斐波那契的递归函数

<span style="font-size:18px;">#include <stdio.h>#include <string.h>/*int main()//此为常规方法{int i;int a[32];a[0]=0;a[1]=1;printf("%d ",a[0]);printf("%d ",a[1]);for (i=2;i<40;i++){a[i]=a[i-1]+a[i-2];printf("%d ",a[i]);}return 0;}*/int F(int i){if (i<2)return i==0?0 : 1;return F(i-1)+F(i-2);}int main(){int i;for (i=0;i<32;i++)printf("%d ",F(i));return 0;}</span>

运行结果如下：