Walmart Labs Interview Question
Java DevelopersCountry: United States
Interview Type: In-Person
I think we should use Divide and Conquer for efficiency when we impletement recursive version.
int powerRecursive(int num,int pow)
{
if (pow == 0)
{
return 1;
}
if (pow == 1)
{
return num;
}
int half = powerRecursive(num, pow/2);
if (pow % 2 == 0)
{
return half * half;
}
else
{
return half * half * num;
}
}
}
- schemaless October 11, 2015