CodingBat Java Recursion-1 powerN

CodingBat code practice

Java > Recursion-1 > powerN
prev | next | chance

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).

powerN(3, 1) → 3
powerN(3, 2) → 9
powerN(3, 3) → 27
...Save, Compile, Run
public int powerN(int base, int n) { }

See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops

prev | next | chance | CodingBat > Recursion-1

Forget It! -- delete my code for this problem

New just for fun
Random User Progress Graphs
Random Epic Graphs 327.0