计算x^n,用普通的算法就是x乘n次的话,时间复杂度就是O(n)
利用分治法
x ^ n = x^(n/2) *x(n/2) ( n是偶数)
= x^((n-1)/2)*x^((n-1)/2)*x (x是奇数)
这样的话 T(n) = O(1) if x = 1
= T(n/2)+O(1) (此处原来是2*T(n/2)+O(1) ,但是可以只计算一次)
根据主定理: T(n) = O(lgn)
代码如下
#include <iostream>
#include <math.h>
#include <time.h>
using namespace std;
float fast_pow ( float x, float y ) {
int temp;
if ( y == 1 )
return x;
else if ( (int)y % 2 == 0 ) {
temp = fast_pow(x,y/2); // 用临时变量减少重复的运算
return temp*temp;
}
else {
temp = fast_pow(x,(y-1)/2);
return temp*temp*x;
}
}
float common_pow ( float x, float y ) {
float result = 1;
for ( float i = 1; i <= y; ++i ) {
result *= x;
}
return result;
}
int main()
{
float x; // 底数
float y; // 次数
clock_t start, finish;
clock_t t1, t2;
float result1, result2;
cout << "输入x:" ;
cin >> x;
cout << endl;
cout << "输入y:";
cin >> y;
cout << endl;
// 原始法
start = clock();
result1 = common_pow(x,y);
finish = clock();
t1 = finish - start;
start = clock();
result2 = fast_pow(x,y);
finish = clock();
t2 = finish - start;
if( result1 == result2 ) {
cout << "x^y = " << result1 << endl;
cout << "标准法用时为 " << t1 << endl;
cout << "快速幂法用时为 " << t2 << endl;
}
else {
cout << "运算出错";
}
return 0;
}
输入x:1.01
输入y:10000000
x^y = inf
标准法用时为 1620
快速幂法用时为 112