Function power

Exercises/Modules/Chapter 08/Soln8_09.cpp:21–30

Recursive function to calculate x to the power n

// Recursive function to calculate x to the power n
long double power(double x, int n)
{
  if (n == 0)     return 1.0;
  else if (n < 0) return 1.0 / power(x, -n);
  else if (n % 2) return mult(x, power(x, n - 1));     // x is odd
  
  // If we make it this far, x > 0 and even
  const auto y{ power(x, n / 2) };
  return mult(y, y);
}