Fibonacci (naive)

ActiveReturned

call stack

last in, first out

fib(5)

pseudocode

fib(n)
  if n <= 1: return n
  return fib(n - 1) + fib(n - 2)

recursion tree

every call branches, every return climbs back

fib(5)

Frame 1 / 46

Call fib(5)

start

Speed4

n =

n: 0–6