现在用如下代码来计算下 xn,其时间复杂度为( )
double quick_power(double x,unsigned n){ if(n == 0)return 1; if(n == 1)return x; return quick_power(x, n/2) *quick_power(x,n/2) *((n&1)?x:1); }
O(n)
O(1)
O(logn)
O(nlogn)