0
/ 50
Given base
and n
that are both 1 or more, compute recursively (no loops) the value of base
to the n
power, so powerN(3, 2)
is 9 (3...
Given base
and n
that are both 1 or more, compute recursively (no loops) the value of base
to the n
power, so powerN(3, 2)
is 9 (3 squared).
Your feedback will appear here when you check your answer.