Sign inSign in
ConceptSystems & CS

External merge sort

A divide-and-conquer sorting algorithm that splits data into runs, sorts them individually in memory, and then combines them into longer sorted runs on disk.
as Jignesh Patel defines itCarnegie Mellon University
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.

Buffer pool2Disk I/O1Merge sort1Sorting1Sorting algorithms1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Lectures that assume it

    1

    Connections

    9

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

    Concepts7

    Show 1 more

    Lectures2

    1 lecturer. 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.