Sorts integers byte by byte from the least significant to the most significant byte, applying a stable counting sort at each pass; for 32-bit integers only four passes are needed to fully sort the array.
Base 256 (8-bit bytes) processes the maximum number of bits per pass while keeping the 256-entry counting table small enough to fit in L1 cache, the most common base in high-performance radix sort implementations.