Recursion to Iteration exponents Help

[williamsb14]

solved

[JosAH]

You're doing way too much in your implementation; think of the exponent as a binary number; if bit i is one, the result should be multiplied by base^(i+1); e.g. if the exponent is 5, the result should be b^4*b^1. In Java this means:

public double power(double base, int n) {
   double result= 1;
   for (; n > 0; n/= 2, base*= base)
      if ((n%2) != 0) result*= base;
   return result;
}

kind regards,

Jos