ConceptTheory & Algos
Comparison sort
A sorting algorithm that determines the sorted order of elements by comparing pairs of items, running in O(|L| lg |L|) time.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.