CareerCup

C# Solution

/* Problem: Print Fibonacci numbers between (n,m)
         * 
         * Assumptions: m > n
         * 
         * Algorithm:
         * 1. Start calculating Fibonacci numbers from 0
         * 2. If the number lies between desired range, print it.
         * 
         * Complexity: O(N)
         * 
         * Test cases:
         * - (0, 1)   => outputs 0,1,1. This falls between (0, 32) 
         * - (0, 32)
         * - (5, 32)
         * 
         * - (-1, 3) => fail
         * - (32, 0) => fail
         */
        public static void FindFibonacciNumbersInRange(int n, int m)
        {
            if (n < 0 || m < 0 || n >= m)
                throw new ArgumentException("enter correct range");

            int a = 0;
            int b = 1;

            //Print out the first two numbers if in range.
            if (n == 0)
            {
                Console.WriteLine(a);
                Console.WriteLine(b);
            }
            if (n == 1)
                Console.WriteLine(b);

            int c = a + b;
            

            while (c <= m)
            {
                if (c >= n)
                    Console.WriteLine(c);
                a = b;
                b = c;
                c = a + b;
            }
        }

a simplest code will look like this:
int f,f1,f2;
f1=0,f2=1;
for(i=0;i<7;i++)
{
f=f1+f2;
f1=f2;
f2=f
printf("%d",f);
}

public void fibo(int low, int high){


int[] arr = new int[];
arr[0] = 0;
arr[1] = 1;

if(arr[0] >= low && arr[0] <= high){
System.out.print(arr[0] + " ");
}

if(arr[1] >= low && arr[1] <= high){
System.out.print(arr[1] + " ");
}

int i = 2;
while(arr[i] <= high){

arr[i] = arr[i-1] + arr[i-2];
if(arr[i] >= low && arr[i] <= high){
System.out.print(arr[i] + " ");
}
i++;
}

}

find("Fibonacci numbers between 0-32");