费波那其数列,1,1,2,3,5……编写程序求第n项。
#include <iostream>
using namespace std;
unsigned phe( int n );
unsigned main(void)
......{
cout << phe(50 << endl;
return 0;
}
//方法1:
unsigned phe( int n )
......{
unsigned *a;
a = new unsigned[ n + 1 ];
a[1] = 1;
a[2] = 1;
for( int i = 3; i < n + 1; i++ )
a [i] = a[i - 1] + a[i -2 ];
unsigned int temp = a[n];
delete a;
return temp;
}//此种方法利用了简单的数组存放.
//方法2:
unsigned phe( int n )
......{
if (n == 1 || n == 2)
return 1;
return( phe(n - 2) + phe(n - 1) );
}//此种方法虽然看起来简单,但是却应为同时又两个取递归,导致堆栈的崩溃.长时间看不到结果 .
//方法3:
unsigned phe( int n )
......{
int a,b ,result;
a = b = 1;result = 2;
for( int i = 4; i < n + 1; i++ )
......{
a = b;
b = result;
result = a + b;
}
return result;
}//此种方法是方法1的改进.不用保存以前的数据.
#include <iostream>
using namespace std;
unsigned phe( int n );
unsigned main(void)
......{
cout << phe(50 << endl;
return 0;
}
//方法1:
unsigned phe( int n )
......{
unsigned *a;
a = new unsigned[ n + 1 ];
a[1] = 1;
a[2] = 1;
for( int i = 3; i < n + 1; i++ )
a [i] = a[i - 1] + a[i -2 ];
unsigned int temp = a[n];
delete a;
return temp;
}//此种方法利用了简单的数组存放.
//方法2:
unsigned phe( int n )
......{
if (n == 1 || n == 2)
return 1;
return( phe(n - 2) + phe(n - 1) );
}//此种方法虽然看起来简单,但是却应为同时又两个取递归,导致堆栈的崩溃.长时间看不到结果 .
//方法3:
unsigned phe( int n )
......{
int a,b ,result;
a = b = 1;result = 2;
for( int i = 4; i < n + 1; i++ )
......{
a = b;
b = result;
result = a + b;
}
return result;
}//此种方法是方法1的改进.不用保存以前的数据.