recurrence
Divide-and-conquer algorithms as recurrences
taught
Taught in
-
Divide-and-conquer algorithms as recurrences
Discrete Mathematics II — Combinatorics
Requires
- recursion-in-algorithms required
- first-order-linear-recurrences required
Required by
- The iteration/unrolling method required
- The recursion-tree method required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.