Radix Sort

Harold Seward, 1954

Radix Sort, formalized by Harold Seward in 1954, sorts integers without comparing them directly. Instead, it distributes numbers into buckets based on each digit, starting from the least significant digit (LSD). After each pass, the numbers are collected from the buckets in order, and the process repeats for the next digit position. With a time complexity of O(d·n) where d is the number of digits, it can outperform comparison sorts for certain data. The visualization colors each bar by its bucket assignment for the current digit pass, with gold highlighting the element currently being distributed.