about | help | code help+videos | done | prefs |
powerN
Consider a function powerN(base,n) where you are given base and n that are both positive integers. You must compute recursively (no loops) the value of base to the n power, so powerN(5, 2) is 25 (5 squared). powerN(1, 1) → 1 powerN(10, 2) → 100 powerN(3, 3) → 27 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy