(6)递归实现求Fibonacci数列
#include<stdio.h>
int fib(int n);
int main()
{
int n;
scanf("%d",&n);
printf("fib(%d)=%d",n,fib(n));
return 0;
}
int fib(int n)
{
int result;
if(n==0)
result=0;
else if(n==1)
result=1;
else
result=fib(n-2)+fib(n-1);
return result;
}