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.
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
1Lectures that assume it
1Connections
9The lectures that define it or assume it, and the concepts next to it.