1. Fibonacci数列
无穷数列1,1,2,3,5,8,13,21,34,55,……,称为Fibonacci数列。它可以递归地定义为:
第n个Fibonacci数可递归地计算如下:
int fibonacci(int n)
{
if (n <= 1) return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
1.改用递推函数,求第45,46,47,48个Fibonacci数所花费的时间,观察效率是否得到提高
#include<stdio.h>
#include <stdlib.h>
#include <time.h>
int fibonacci(int n)
{ if(n <= 2)
return 1;
int n1 = 1, n2 = 1, sn = 0;
for(int i = 0; i < n - 2; i ++)
{sn = n1 + n2;
n1 = n2;
n2 = sn; }
return sn;
}
int main(){
double duration;
duration=clock()/CLOCKS_PER_SEC;
fibonacci(45);
duration=clock()/CLOCKS_PER_SEC-duration;
printf("第45个花费的时间:%f\n",duration);
duration=clock()/CLOCKS_PER_SEC;
fibonacci(46);
duration=clock()/CLOCKS_PER_SEC-duration;
printf("第46个花费的时间:%f\n",duration);
duration=clock()/CLOCKS_PER_SEC;
fibonacci(47);
duration=clock()/CLOCKS_PER_SEC-duration;
printf("第47个花费的时间:%f\n",duration);
duration=clock()/CLOCKS_PER_SEC;
fibonacci(48);
duration=clock()/CLOCKS_PER_SEC-duration;
printf("第48个花费的时间:%f\n",duration);
}