Recursion and Dynamic Programming

Fibonacci with Memoization

Compute fib(n) recursively. Cache each fib(k) in a memo map so each subproblem is solved at most once.

Algorithm

Canonical input n = 6 produces fib(6) = 8. Replay highlights every memo write and every cache hit.

memoization A `map[int]int` keyed by `n` stores each completed subproblem. Before recursing, check `memo[n]`: a hit returns immediately, a miss descends.
explicit memo state The memo is a package-level `map` so the recursion stays about caching, not parameter passing.

Basic Implementation

basic.go
Replay: real traced execution (multi-file project)
package main

import "fmt"

var memo = map[int]int{}

func fib(n int) int {
	if v, ok := memo[n]; ok {
		return v
	}
	if n < 2 {
		memo[n] = n
		return n
	}
	value := fib(n-1) + fib(n-2)
	memo[n] = value
	return value
}

func main() {
	result := fib(6)
	fmt.Println(result)
	fmt.Println(memo)
}

  1. memo ← {}, action ← miss -> descend fib(5)

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{}memomiss -> descend fib(5)action6n

  2. memo ← {}, action ← miss -> descend fib(4)

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{}memomiss -> descend fib(4)action5n

  3. memo ← {}, action ← miss -> descend fib(3)

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{}memomiss -> descend fib(3)action4n

  4. memo ← {}, action ← miss -> descend fib(2)

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{}memomiss -> descend fib(2)action3n

  5. memo ← {}, action ← miss -> descend fib(1)

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{}memomiss -> descend fib(1)action2n

  6. memo ← {1: 1}, action ← base 1; memo[1] = 1; return

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{1: 1}memobase 1; memo[1] = 1; returnaction1n

  7. memo ← {0: 0, 1: 1}, action ← base 0; memo[0] = 0; fib(2)=1; memo[2] = 1

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{0: 0, 1: 1}memobase 0; memo[0] = 0; fib(2)=1; memo[2] = 1action0n

  8. memo ← {0: 0, 1: 1, 2: 1, 3: 2}, action ← hit 1; fib(3)=2; memo[3] = 2

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{0: 0, 1: 1, 2: 1, 3: 2}memohit 1; fib(3)=2; memo[3] = 2action1n

  9. memo ← {0: 0, 1: 1, 2: 1, 3: 2, 4: 3}, action ← hit 1; fib(4)=3; memo[4] = 3

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{0: 0, 1: 1, 2: 1, 3: 2, 4: 3}memohit 1; fib(4)=3; memo[4] = 3action2n

  10. memo ← {0: 0, 1: 1, 2: 1, 3: 2, 4: 3, 5: 5}, action ← hit 2; fib(5)=5; memo[5] = 5

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{0: 0, 1: 1, 2: 1, 3: 2, 4: 3, 5: 5}memohit 2; fib(5)=5; memo[5] = 5action3n

  11. memo ← {0: 0, 1: 1, 2: 1, 3: 2, 4: 3, 5: 5, 6: 8}, action ← hit 3; fib(6)=8; memo[6] = 8

    14}15value := fib(n-1) + fib(n-2)16memo[n] = value
    values this step{0: 0, 1: 1, 2: 1, 3: 2, 4: 3, 5: 5, 6: 8}memohit 3; fib(6)=8; memo[6] = 8action4n

  12. stdout ← 8

    21result := fib(6)22fmt.Println(result)23fmt.Println(memo)
    values this step8stdout8result

Complexity

  • Time: O(n) with memoization (vs. O(2^n) without)
  • Space: O(n) memo + O(n) call stack

Implementation notes

  • Go: a package-level memo := map[int]int{} plus the v, ok := memo[n] comma-ok pattern keeps the memo lookup and write visible without hiding the lesson behind a closure.
  • The replay shows the call stack on one side and the memo map on the other so memo writes and cache hits are visually distinct.