Sign inSign in

Counting sort

A sorting algorithm that counts the number of occurrences of each key to construct the sorted list in linear time.
as Ryan O'Donnell 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.

Array1Array data structure1Asymptotic notation1Integer sorting1List1RAM model1Sorting algorithms1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A linear-time sorting algorithm for integers that counts the frequency of each key value to place items in sorted order.
    • 36:55Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort

Lectures that assume it

1

Connections

8

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

Concepts5

2 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.