Sign inSign in
ConceptSystems & CS

Merge sort

A sorting algorithm that recursively divides a list into two halves, sorts them, and then merges the sorted halves.
as Tom Leighton defines itMITThe wording closest to all 5 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

5

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    A divide-and-conquer sorting algorithm that recursively splits a list in half and then merges the resulting sorted sublists in a smart way.
  • Srini Devadas

    MIT · Undergraduate

    A divide-and-conquer sorting algorithm that recursively splits an array into halves, sorts them, and merges the sorted halves.
    • 25:01Insertion Sort, Binary Insertion & Merge Sort Recurrences
  • Julian Shun

    MIT · Undergraduate

    A sorting algorithm that recursively divides the input into two halves, sorts them, and merges the results.
  • David J. Malan

    Harvard University · Undergraduate

    A sorting algorithm that divides a list of numbers in half, sorts each half recursively, and then merges the sorted halves together.

Lectures that assume it

5

Connections

19

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.