CareerCup

binary search of z*z*z = X

I havn't verifed this code!

int qroot(int x) {
  int a=0,b=x,r;
  for (;;) {
    r = (b + a) / 2;
    int t = r*r*r;
    if (a==b) return r;
    if (t<x) a -= (b-a)/4;
    else b += (b-a)/4;
  }
}

binary search :)

Use Newton Raphson Method. As this is what i think the interviewer is looking for.

int exponent=3;
int pow( int base,int exponent)
{
if (exponent == 0) return 1; // base case;
int temp = pow(base, exponent/2);
if (exponent % 2 == 0)
return temp * temp;
else
return (base * temp * temp);
}