Write a program to generate the Fibonacci series using non-recursive method?

Answer 1

In c:

int fibr(int n) { // Find nth Fibonacci number using recursion.

if (n<=2) return 1; // the first two Fibonacci numbers are 1 and 1

return (fibr(n-2)+fibr(n-1));

}

int fibi(int n) { // Find nth Fibonacci number using iteration.

int temp,last=1,f=1;

int i;

for (i=3;i<n;++i) { // the first two Fibonacci numbers are 1 and 1

temp=f;

f+=last;

last=temp;

}

return f;

}

Answer 2

f_1= 1;

f= 1;

for (i=3; i<=n; ++i) {

f_2 = f_1;

f_1 = f;

f= f_1 + f_2;

}

printf ("f(%d)=%d\n", n, f);