Question: Use recursion to solve following problem. Then determine the running time Powering of a number: For a give number X and an integer n >=
Use recursion to solve following problem. Then determine the running time Powering of a number: For a give number X and an integer n >= 0, compute X^n Normally, we would multiply X, n times. However that will give is O(n) time. How do we do this calculation better using recursion? Write down your algorithm and prove its time complexity is better then O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
