CareerCup

stack a;
Fibonacci(n){ // to produce a n level Fibonacci sequence
int a=0,b=1;
a.push(a);
a.push(b);
    print a;
   while(n!=0){
    a = a.pop();
    b = a.pop();
    print b;
    a.push(b);
    a.push(a+b);
    n--;
    }

{
// Without Recursion
int Fibonacci(int n)
{
	int prev1 = 1, prev2 = 1;
	int cur = 0;

	if (n <= 2)
		return 1;
	else
		{
			for (int i = 3; i <= n; i++, prev2 = prev1, prev1 = cur)
			{
				cur = prev2 + prev1;
			}
			return cur;
		}
}

}

int fibonacci(int n)
{
int fib0 = 0, fib1 = 1, i, temp;

if (n == 0) return fib0;
else if (n == 1) return fib1;

/* After each iteration, fib0 and fib1 are
* the ith and (i-1)st fibonacci numbers
*/
for (i = 2; i <= n; ++i)
{
temp = fib1;
fib1 = fib0 + fib1;
fib0 = temp;
}

return fib1;
}

int fibonacci(int i){
if((i==1)||(i==2))
return 1;
else
return (fibonacci(i-1)+fibonacci(i-2));
}

void main(){

cout << fibonacci(6);

}