ArraysLesson 10Free preview

DSA Radix Sort

This lesson is part of DSA · All levels

Summary

Radix sort sorts the data digitally by digit, from the least significant to the most significant, using counting sort as a subroutine. Since each digit is processed separately, the total work becomes O(d * (n + k)) with d the number of digits. The radix sort is suitable for integers or strings with a finite number of digits.

Key points

Sorting by digit from unit to thousand.
Using a stable sort count as a sorting of each digit
Complexity O(d * (n + k)) with d as the number of digits and k as the base
Suitable for data with a wide range of values but a limited number of digits

Full lesson

Code examples and quizzes

Full lessons, code examples, and quizzes are available to subscribers. 5 questions.