Sign inSign in

Divide and conquer

An algorithmic paradigm that breaks a problem into smaller subproblems of the same type, solves them recursively, and combines their results.
as Erik Demaine & Srini Devadas defines itMITThe wording closest to all 8 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.

Recursion6Algorithm1Algorithm complexity1Basic mathematics1Political power dynamics1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    • 5:08Course Overview, Interval Scheduling
    • 2:31Divide & Conquer: Convex Hull, Median Finding
  • David J. Malan

    Harvard University · Undergraduate

    An algorithmic strategy that breaks a problem into smaller sub-problems, solves them, and combines the results.
  • Julian Shun

    MIT · Undergraduate

    An algorithmic paradigm that solves a problem by recursively breaking it down into smaller sub-problems of the same type.
    • 1:02:15Caching and Cache-Efficient Algorithms
  • Srini Devadas

    MIT · Undergraduate

    A strategy that recursively breaks a problem down into smaller sub-arrays to solve it efficiently.
    • 25:18Algorithmic Thinking & Peak Finding in 1D and 2D
  • Clive Stafford Smith

    Gresham College · Undergraduate

    A political strategy of gaining and maintaining power by breaking up larger concentrations of power into chunks that individually have less power, such as stirring up hatred toward specific groups.
    • 25:27Give Peace a Chance: Legal Implications of the Israel-Palestine Conflict

Lectures that assume it

8

Connections

23

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

5 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.