Write a recursive function power (base, exponent) that, when invoked, returns ba

Question

Write a recursive function power (base, exponent) that, when invoked, returns base exponent. For example, power (3,4)=3 * 3 * 3 *3. Assume that exponent is an integer greater than or equal to 1. The recursion step would use the relationship

baseexponent = base * base exponent -1

and the terminating condition occurs when exponent is equal to 1, because

base1 = base

Incorporate this function into a script that enables the user to enter the base and exponent. It has to be in HTML format. This is what the output should look like.

Explanation / Answer

#include <iostream>

using std::cout;

using std::cin;

using std::endl;

int power (int, int);

int main ()

{

int base, exp, result;

//obtain integer from user

cout<<"Enter the base value: ";

cin >>base;

cout<<"Enter the exponent value: ";

cin>>exp; result = power(base, exp);

cout<<"The result is: "<< result << endl;

return 0;

}

// recursive definition

int power (int base, int exp)

{

// base case

if (exp==1)

return base * 1;

// recursive step

else if (exp >-1)

exp--;

return base * (power(base,exp));

}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

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