递归实现求第n个斐波那契数
#include <stdio.h>
int fib(int n)
{
if (n <= 2)
return 1;
else
return fib(n - 1) + fib(n - 2);}
int main()
{
int n = 0;
printf("请输入一个第n个数,第n个数的菲波那切数为:\n");
scanf("%d", &n);
printf("%d\n", fib(n));
return 0;
}
非递归分别实现求第n个斐波那契数
#include<stdio.h>
int fib(int n)
{
int a1 = 1;
int a2 = 1;
int a3 = 0;
if( n <= 2 )
return 1;
else
{
while(n > 2)
{
a3 = a1 + a2;
a1 = a2;
a2 = a3;
n--;
}
}
return a3;
}
int main()
{
int n = 0;
printf("请输入一个第n个数,第n个数的菲波那切数为:\n");
scanf("%d",&n);
printf("%d",fib(n));
return 0;
}