#include <stdio.h>
long fun(int g)
{
switch(g)
{
case 0:
return 0;
case 1:
return 0;
case 2:
return 1;
}
return (fun(g-1) + fun(g-2));
}
main()
{
long fib;
int n;
printf("Input n: ");
scanf("%d", &n);
printf("n=%d\n", n);
fib = fun(n);
printf("fib = %d\n\n", fib);
}
用递归算法求斐波那契数列的第N项值
最新推荐文章于 2024-04-25 17:04:59 发布