ConceptTheory & Algos
Counting sort
A sorting algorithm that counts the number of occurrences of each key to construct the sorted list in linear 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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
A linear-time sorting algorithm for integers that counts the frequency of each key value to place items in sorted order.
Lectures that assume it
1Connections
8The lectures that define it or assume it, and the concepts next to it.