Question: Write a recursive method that given a base and an exponent (both 1 or more, no zeros, no negatives) returns the base to the exponent

Write a recursive method that given a base and an exponent (both 1 or more, no zeros, no negatives) returns the base to the exponent power. For example,powerN(4,2) is 42 = 16. Do not use loops. Do not use Math.pow. Write a method which uses recursion to find the answer to baseexp, in the space given below.

 int powerN( int base, int exp ) { 

}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!