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

August 08, 2006 13:03:42	#6
hari	Member Since: Visitor Total Comments: N/A
RE: write an O(log2(N)) algorithm to find X^N
int xpwrn(int x,int n){ if(n==1) return x ; else if(n>1) { if(n%2==0) { xpwrn(x,n/2)xpwrn(x,n/2); } else { xxpwrn(x,n/2)*xpwrn(x,n/2); } }}