Lesson 4 of 11Article17 min
Recurrence Relations & Induction Practice
Fibonacci, divide-and-conquer runtimes, and dynamic programming tables are recurrences. Solve linear homogeneous ones with characteristic equations.
Sequences defined by previous terms
Fibonacci, divide-and-conquer runtimes, and dynamic programming tables are recurrences. Solve linear homogeneous ones with characteristic equations.
- Strong induction: assume all prior cases, prove next.
- Master theorem (CS link) estimates divide-and-conquer T(n).
Always pin down initial conditions — the same recurrence with different starts is a different sequence.