ConceptSystems & CS
Master method
A general method for solving divide-and-conquer recurrences of the form T(n) = aT(n/b) + f(n).
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
5The lectures that define it or assume it, and the concepts next to it.