Answer Detail: RE: write an O(log2(N)) algorithm to find X^N

GeekInterview.com > Placement Papers > Adobe > Placement Papers

Print |

Question: write an O(log2(N)) algorithm to find X^N

May 05, 2006 00:48:14	#5
Ashish Bhawsar	Member Since: Visitor Total Comments: N/A
RE: write an O(log2(N)) algorithm to find X^N
long Pow(int x, int n){ long Power=1,z=x,m=n; while(m>0) { while(m%2==0) { m=m/2; //Integer division z=zz; } m--; Power=z; } return Power;}