CJCoding With Joseph

Function: Recursive Power

Write a recursive function power(int base, int exp) that returns base raised to exp (assume exp >= 0). The base case is exp == 0 returning 1; otherwise return base * power(base, exp - 1). Call it with 2 and 10 and print the result:

1024

Print with %d. Do not use a loop.

Expected Output:

1024
Topics:
Functions/Methods
Code Editor
1
Tab to indent ยท Ctrl+Enter to run ยท Ctrl+Space to expand shortcuts (p, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.