Sign inSign in

Divide and conquer recurrence

Recurrences where you break the problem up into much smaller subproblems, like half the size or two-thirds the size.
as Tom Leighton defines itMITThe wording closest to all 3 definitions
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Tom Leighton

    MIT · Undergraduate

    • 51:15Divide and Conquer Recurrences
  • Srini Devadas

    MIT · Undergraduate

    A recurrence relation expressing the execution time of a recursive divide and conquer algorithm as a function of the input size.
    • 32:08Algorithmic Thinking & Peak Finding in 1D and 2D

Lectures that assume it

1

Connections

11

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.