(Recursive Exponentiation) 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. Hint: The recursion step would use the relationship
base exponent = base · base exponent - 1
and the terminating condition occurs when exponent is equal to 1, because
base1 = base
Solution:
base exponent
For example, power( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship
base exponent = base · base exponent - 1
and the terminating condition occurs when exponent is equal to 1, because
base1 = base
Solution:
#include <iostream> using std::cout; using std::cin; using std::endl; int power(int, int); int main() { int base, exponent; cout << "Enter base and exponent: "; cin >> base >> exponent; cout << "Result is " << power(base, exponent); return 0; } int power(int base, int exponent) { while(exponent != 1) { return base * power(base, (exponent - 1)); } return base; }
please can you translate this code to a JVM style
ReplyDelete