非递归代码如下:
#include<stdio.h>
int main()
{
int a = 1;
int b = 1;
int c = 1;
int n = 0;
scanf("%d", &n);
while (n - 2)
{
c = a + b;
a = b;
b = c;
n--;
}
printf("第n个斐波那契数是:%d\n", c);
system("pause");
return 0;
}
递归代码如下:
#include<stdio.h>
int fib(int n)
{
if (n > 2)
{
return fib(n - 1) + fib(n - 2);
}
else
{
return 1;
}
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = fib(n);
printf("第n个斐波那契数是:%d\n", ret);
system("pause");
return 0;
}