Question: int pow(double x, int n) { if(n==0) return 1; else { double halfpower = pow(x, n); if(n%2==0) { return halfpower*halfpower; } else { return halfpower*halfpower*X;
int pow(double x, int n)
{
if(n==0) return 1;
else {
double halfpower = pow(x, n);
if(n%2==0)
{
return halfpower*halfpower;
}
else
{
return halfpower*halfpower*X;
}
} What is the worst case runtime
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
