RECURSION SIMULATION

▸ Building the call stack…
▸ Loading factorial · Tower of Hanoi
▸ Loading the Fibonacci tree (± memoization)
▸ Loading recursive fractals (tree · Koch)
▸ Hashing each push/pop step for replay…
▸ Ready — Online. ✅
0%
⌂ Mind & Machine

Simulation room Recursion & Stack

Recursion & Call Stack
Online
push/pop frames · call tree · fractal
Recursion & stack
➗ Factorial n!
Total calls—
Frames / max depth—
Base hits—
Return value—
Complexity—
Viewing—
Notes
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 time total callsframe depth
About Recursion & Call Stack

Recursion & Call Stack is one of 20 topics in the Mind & Machine domain (bit → AI scale) at My Labs — an interactive simulation atlas. This virtual lab runs right in your browser: adjust the parameters, pick a scenario and watch the phenomenon change in real time, with a click-to-inspect cross-section for every structure.

Related topics in Mind & Machine