Write a recursive function power (base, exponent) that, when invoked returns base exponent For example, power (3, 4) = 333*3. Assume that exponent is an integer greater than or equal to 1.

Question

Computers & Technology

Larissa Irwin

12 May, 17:10

Write a recursive function power (base, exponent) that, when invoked returns base exponent For example, power (3, 4) = 333*3. Assume that exponent is an integer greater than or equal to 1.

+4

Answers (1)

Know the Answer?

Mikaela Mullen · Answer 1

int power (int base, int exponent)

{

if (exponent==1) / /base case.

return base;

return base*power (base, exponent-1); //recursive call.

}

Explanation:

The above written function is for calculating base^exponent using recursion. In calculating the power n of a number we have multiply that number with itself n times. So the recursion is calculating the base^exponent-1 and we are multiplying the last base by ourselves.

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.

Write a recursive function power (base, exponent) that, when invoked returns base exponent For example, power (3, 4) = 333*3. Assume that exponent is an integer greater than or equal to 1.