分治法实例:乘方运算

根据如上公式,可以写出O(lgn)的算法:

 1 int Power(int num,int index)
 2 {
 3     if(index==1)
 4         return num;
 5     if(index%2==0)
 6     {
 7         return Power(num*num,index/2);
 8     }else
 9     {
10         return num*Power(num*num,index/2);
11     }
12 }

 

转载于:https://www.cnblogs.com/crazycodehzp/p/3685238.html