用循环解决
2、编写递归函数求Fibonacci数列的第n
项,这个数列是这样定义的:
fib(0)=1
fib(1)=1
fib(n)=fib(n-1)+fib(n-2)
/*使用循环求fibonacci数列*/
#include<stdio.h>
int main()
{
int a=1;
int b=1;
int c,n;
printf ( "please enter N:" );
scanf ( "%d",&n );
int m=n;
if (n<=1)
c=1;
while ( n>1 )
{
c=a+b;
n=n-1;
b=a;
a=c;
}
printf( "f(%d)=%d\n",m,c );
return 0;
}
转载请注明源地址:http://blog.csdn.net/whorus1/article/list/2,谢谢!