（C语言）用递归方法编写求斐波那契数列的函数
用递归方法编写求斐波那契数列的函数，返回值为长整型。斐波那契数列的定义为：f(n)=f(n-2)+f(n-1)(n>1) 其中f(0)=0, f(1)=1
并写出相应主函数
哪位好心人帮帮忙啊，谢谢啦，我是初学啊
#include<stdio.h>
long func(long n)
{
if(n==0||n==1)return n;
else return func(n-1)+func(n-2);
}
main()
{
long n;
printf("please input n:");
scanf("%ld",&n);
printf("the result is %ld",func(n));
}
long func(long n)
{
if(n==0||n==1)return n;
else return func(n-1)+func(n-2);
}
main()
{
long n;
printf("please input n:");
scanf("%ld",&n);
printf("the result is %ld",func(n));
}
温馨提示：内容为网友见解，仅供参考
第1个回答 2007-06-18
long Fib2(int n)
{ long int oneBack, twoBack, current;
int i;_
if(n == 0 || n == 1) return n;
else
{ oneBack = 1;
twoBack = 0;
for(i = 2; i <= n; i++)
{ current = oneBack + twoBack;
twoBack = oneBack;
oneBack = current;
}
return current;
}
}
{ long int oneBack, twoBack, current;
int i;_
if(n == 0 || n == 1) return n;
else
{ oneBack = 1;
twoBack = 0;
for(i = 2; i <= n; i++)
{ current = oneBack + twoBack;
twoBack = oneBack;
oneBack = current;
}
return current;
}
}
相似回答
