Computer Algorithms

Let a and n be nonnegative integers. Consider the problem of calculating the n^th power of a: a^n.

Develop a recursive reduce-by-one algorithm for the calculation, establish and solve the recurrence relation for the number of multiplications performed overall.

Test your algorithms in Java at

http://codingbat.com/prob/p158888

Submission Requirement:

Submit your algorithms in Java as an attachment in a text document on Blackboard. Your method should use the signature as follows:

public int powerN(int base, int n) {

}