Chapter 5, Problem 9R

Explanation of Solution

Non-recursive method for power:

The non-recursive method for power is given below:

Create the method power() that accepts the input parameter as “num” and “pow” to calculate and return the power of number.

//Define the power() method

public static double power(double num, int pow)

{

  //Declare and initialize the variables

  int n = 0;

  double ans = 1;

  //Loop executes until the power value

  while ((1 << n) <= pow)

  //Increment the "n" by "1"

  n++;

  //Loop executes until the power value

  for (int i= n-1; i >= 0; --i)

  {

  //Multiply "ans" with "ans"

  ans *= ans;

  //Check bitwise "i" and "pow" is greater than "0"

...