This problem considers several ways to compute x" for some n > 0.
a. Write an iterative method powerl to compute x" for n > 0.
b. Write a recursive method power2 to compute xu by using the following recursive formulation:
x° = l
xn = x*xn if n-1 if n > 0
c. Write a recursive method power3 to compute x" by using the following recursive formulation:
x° = 1
x" = (xn/2)2 if n > 0 and n is even
x" = x* (xn//2)2 if n > 0 and n is odd
d. How many multiplications will each of the methods powerl, power2, and power3 perform when computing 332? 319?
e. How many recursive calls will power2 and power3 make when computing 3°2 ? 319?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.