Question: Consider the following algorithm for computing a x given a and x: function power (a, x) if (x == 0) then return (1) if (x
Consider the following algorithm for computing a x given a and x:
function power (a, x) if (x == 0)
then return (1) if (x is even)
then return (power(a, bx/2c))2
else return (a (power(a, bx/2c))2 )
a. What is the running time of this algorithm?
b. What is the recurrence relation for the running time?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
