Sorts by least significant digit first, then moves to more significant digits. Elements flow into 10 buckets (0-9) based on the current digit being examined.
Ready
Digit Pass: -
Moves: 0
Comparisons: 0 (always 0!)
Complexity: O(d × (n + k)) d = digits, k = base (10)
How Radix Sort Works
LSD (Least Significant Digit): Start from the rightmost digit.
For each digit position, distribute elements into 10 buckets (0-9) based on that digit, then collect them back in bucket order.
After processing all digit positions, the array is sorted. No element comparisons are ever made — only digit extraction and bucket placement.