| |
Recursion Practice | page 5 of 9 |
Write a recursive power function that raises a base to some exponent, n. We will use integers to keep things simple.
double power(int base, int n)
// Recursively determines base raised to the nth power.
// Assumes 0 <= n <= 10.
|