No recursive method is used to implement the Fibonacci sequence, and the input number n will output the nth number of the sequence.

#include <stdio.h>
int main ()
{
int a = 0;
int b = 0;
scanf ("%d", &a);
b = fib (a);
printf ("%d\n", b);
System ("pause");
return 0;
}

int fib (int n)
{
int NUM1 = 1;
int num2 = 1;
int num3 = 0;
if (n <= 2)
{
return 1;
}
Else
{
while (n > 2)
{
num3 = Num1 + num2;
NUM1 = num2;
num2 = num3;
n--;
}
}
return num3;
}

This article is from the "0-point Time" blog, please make sure to keep this source http://10741764.blog.51cto.com/10731764/1711221

No recursive method is used to implement the Fibonacci sequence, and the input number n will output the nth number of the sequence.