Need an anylasis explaing the code: Let a and n be both nonnegative integers. Co

Question

Need an anylasis explaing the code: Let a and n be both nonnegative integers. Consider the problem of calculating the nth power of a: an.

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

Compare the results of your three solutions and assess which does more or less work.

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) {

}

Submit your analysis in a typed document as an attachment in pdf or Microsoft Word format on Blackboard online before the due time.

Explanation / Answer

public int powerN(int base, int n) { if (n == 0) { return 1; } return base * powerN(base, n - 1); }

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.