Recursion Tracer

Visualize the execution stack of recursive functions to understand complex algorithms and data passing step-by-step.

Input

// Calculate Nth Fibonacci number
function fib(n) {
  if (n <= 1) return n;
  return fib(n - 1) + fib(n - 2);
}

// Ensure you call the function to start the trace
fib(4);

Execution Graph

Run code to visualize the stack