c++求Fiobonacci數(shù)列的算法效率比較
斐波那契(Fiobonacci)數(shù)列:
算法決定了性能,看兩個關(guān)于數(shù)列的算法,分別用遞歸和數(shù)學(xué)公式計算數(shù)列:



















分別執(zhí)行兩個函數(shù),并顯示一下耗費的時長:
int _tmain(int argc, _TCHAR* argv[])
{
/*效率比較*/
int a;
clock_t start = clock();
for(int i=1;i<5;++i)
a=fiobnacci(35);
cout<<a<<" "<<(clock()-start)/CLK_TCK<<endl;
start = clock();
for(int i=1;i<5;++i)
a=fiobnacci2(35);
cout<<a<<" "<<(clock()-start)/CLK_TCK<<endl;
system("pause");
return 0;}
{
/*效率比較*/
int a;
clock_t start = clock();
for(int i=1;i<5;++i)
a=fiobnacci(35);
cout<<a<<" "<<(clock()-start)/CLK_TCK<<endl;
start = clock();
for(int i=1;i<5;++i)
a=fiobnacci2(35);
cout<<a<<" "<<(clock()-start)/CLK_TCK<<endl;
system("pause");
return 0;}
運行結(jié)果:
9227465 2
9227465 0
Press any key to continue . . .
9227465 0
Press any key to continue . . .