Sign inSign in

Distribution sort

An external memory sorting algorithm analogous to quicksort that uses square root of M over B-way partitioning.
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.

External-memory model1Linear-time selection1Merge sort1

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    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.