ConceptTheory & Algos
Divide and conquer recurrence
Recurrences where you break the problem up into much smaller subproblems, like half the size or two-thirds the size.
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
2Each in their own terms, from the easiest level.
Tom Leighton
Srini Devadas
A recurrence relation expressing the execution time of a recursive divide and conquer algorithm as a function of the input size.
Lectures that assume it
1Connections
11The lectures that define it or assume it, and the concepts next to it.