斐波那契函数的数学定义
斐波那契的递归实现
#include <stdio.h>
int Fbi(int i)
{
if(i<2)
return i == 0?0:1;
return Fbi(i-1)+Fbi(i-2);
}
int main(void)
{
int i;
for(i = 0;i < 40;i++)
printf("[%d] %8d \n",i,Fbi(i));
return 0;
}
斐波那契函数的数学定义
斐波那契的递归实现
#include <stdio.h>
int Fbi(int i)
{
if(i<2)
return i == 0?0:1;
return Fbi(i-1)+Fbi(i-2);
}
int main(void)
{
int i;
for(i = 0;i < 40;i++)
printf("[%d] %8d \n",i,Fbi(i));
return 0;
}