Question: Outline an algorithm to compute a^n (i.e., a power n), where a is a given constant. Assume multiplication of two numbers [of any number of
Outline an algorithm to compute a^n (i.e., a power n), where a is a given constant. Assume multiplication of two numbers [of any number of digits] is ONE basic operation. Achieve an algorithm better than O(n).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
