← Back to Recursion
Question 580
Power By Repeated Multiplying
Power By Repeated Multiplying
Complete power(base: int, exp: int) -> int so it returns base raised to exp by recursion. The base case is written: any number to the power 0 is 1. Add the recursive case, which returns base multiplied by the power with an exponent one smaller. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, the base then the exponent, no prompts, which the tests read and pass to your function before printing the value it returns.
Expected Output:
32= newline. The output ends with a newline — print one after the last line.
Hints2 available
Sign in to use hintsTopics:
Recursion
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (pr, inp, def)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.