Recursion = a function that calls itself on a smaller problem, advancing toward the base case. Each call pushes a stack frame; on reaching the base, the frames pop one by one and bubble the returned value back up.
—
Pick a "Scenario" to change the recursion type (factorial · Hanoi · Fibonacci · memoized · tree · Koch) · drag n to change the depth · click a concept for details
Your browser has canvas disabled.
Total calls & stack depth over timetotal callsframe depth