#include <stdio.h>
#include <string.h>
int my_Fibonacci_1(int n);
int my_Fibonacci_2(int n);
int main(int argc,const char **argv)
{
int n;
while(1)
{
printf("input a int_number:\n");
scanf("%d",&n);while(getchar() != '\n');
if(n <= 0)
{
printf("number invaild!\n");
continue;
}
printf("Fibonacci %d bit is %d\n",n,my_Fibonacci_2(n));
}
return 0;
}
int my_Fibonacci_2(int n)//递归算法
{
if(n == 1 || n == 2)
return 1;
else
return my_Fibonacci_2(n-1)+my_Fibonacci_2(n-2);
}
int my_Fibonacci_1(int n)
{
int num[n+1];
bzero(num,n+1);
num[0] = 0;
num[1] = 1;
if(n==1)
{
return num[1];
}
int i;
for(i=2;i<=n;i++)
{
num[i] = num[i-1]+num[i-2];
}
return num[i-1];
}