AI engineering glossary · Data structures algorithms
What is radix sort?
Radix sort: A non-comparison sorting method that sorts numbers or strings digit by digit, from least to most significant, using a stable sort such as counting sort at each stage. It runs in O(d * (n + k)) for d digits.
Radix sort: an example
Sorting PIN codes: first order all codes by the last digit, then by the fifth digit, and so on to the first, giving fully sorted six-digit codes.
Related terms
More Data structures algorithms terms
- Randomized algorithm
- Recurrence relation
- Recursion
- Red-black tree
- Reservoir sampling
- Segment tree
- Selection sort
- Separate chaining
Where you learn it
Radix sort is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.