Question

write a recursive method power( base, exponent )that , when called returns

base exponent

for example , power (3,4) 3*3*3*3*. assume that exponent is an integer greater than or equal to 1. Hint: the resursion step should use the relationship

base exponent = basec . base exponent. -1

and the terminating condition occurs when exponent is equal to 1, because base1 = base

Incroprate this method into a program that enables the user to enter the base and exponent

Answer 1

double power(double base, int exponent){
   //If exponent is negative
   if(exponent < 0){
      return 1.0/power(base, -1*exponent);
   }
   //If exponent is zero
   else if(exponent == 0){
      return 1;
   }
   //If exponent is positive
   else{
      //recursive call
      return base*power(base,exponent-1);
   }
}