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 07:30:59	#4
mkag	Member Since: Visitor Total Comments: N/A
RE: write an O(log2(N)) algorithm to find X^N
int Sq(int x, int n) { int y = 0; if (n < 0) return -1; if (n == 0) return 1; if (n == 1) return x; if (n % 2 == 0) { y = Sq(x, n/2); return y * y; } y = Sq(x, n/2); return x * y * y; }