Radix sort

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Class

Sorting algorithm

Data structure

Array

Optimal

exactly correct

Worst-case performance

O ( d ⋅ n ) {\displaystyle O(d\cdot n)} , where n {\displaystyle n} is the number of keys, and d {\displaystyle d} is the key length in digits.

Worst-case space complexity

O ( d + n ) {\displaystyle O(d+n)}