#include <stdio.h>
#include <stdlib.h>
int fabonicciRecursive(int);
int fabonicci(int);
int main()
{
int rs = fabonicci(5);
int rs2 = fabonicciRecursive(5);
printf("%d\n", rs);
printf("%d\n", rs2);
return 0;
}
int fabonicciRecursive(int n){
if(n == 1 || n == 2)
return 1;
return fabonicciRecursive(n-1) + fabonicciRecursive(n-2);
}
int fabonicci(int n){
if(n == 1 || n== 2)
return 1;
int a = 1, b = 1, i = 3;
int result;
for(i = 3; i <= n; i++){
result = a + b;
a = b;
b = result;
}
return result;
}
Fibonacci Numbers
最新推荐文章于 2020-07-13 23:41:52 发布