Recursion

Recurrence Relation

508. Fibonacci Number

fib(n)= fib(n-2) + fib(n-1)

70. Climbing Stairs

climb(n) = climb(n-2) + climb(n-1) # curr = pprv + prv

Rod Cutting

rodcut(n, p) = max(r, p[i] + rodcut(n - i, p))

Cache

Tail Recursion