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).
Go...Save, Compile, Run (ctrl-enter)
Editor font size %:75100125150Shorter output
Progress graphs: Your progress graph for this problem Random user progress graph for this problem Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy