Radix Sort
In plain terms
A non-comparison sort that processes numbers digit by digit.
Going deeper
Radix sort groups numbers by individual digits (or bits) from least to most significant, achieving linear time for fixed-width keys. It avoids comparisons entirely.
Under the hood
O(nk) for k-digit keys, beating O(n log n) for suitable integer/string data; relies on a stable subsort like counting sort.
Examples
Sorting integers, fixed-length strings, large numeric datasets.
Think of it like...
Like sorting mail by ZIP digit by digit through a series of bins.