Uploaded June 2024 | Updated September 2026, 2 weeks ago

---

A visualization of the Radix sort algorithm.
We start with a simpler algorithm: Pigeonhole sort (sometimes also called Bucket sort or Bin sort, see below). Then discuss stability of sorting algorithm, and finally Radix sort.

Links:
Quick sort vs Bubble sort: youtu.be/aXXWXz5rF64
Merge sort vs Quick sort: youtu.be/es2T6KY45cA
Heap sort: youtu.be/H5kAcmGOn4Q
Insertion sort vs Bubble sort: youtu.be/TZRWRjq2CAg
Stooge sort and Bogo sort: youtu.be/bfzYj-qGw7U
Shell sort vs Insertion sort: youtu.be/g06hNBhoS1k

About Radix sort:
It dates back to Hollerith's sorting machines from around 1890.
The machines only did Pigeonhole sort, and the human operators were instructed how to use this as a step in Radix Sort.
Initial instructions were for MSD Radix Sort, but apparently an anonymous human operator discovered LSD Radix Sort is easier.

About Pigeonhole sort:
Sometimes it is called Bucket sort or Bin sort. But usually these two refer to an algorithm where each 'bucket' or stack contains a range of possible values, and not just one. Each bucket is then sorted using some algorithm. If each bucket is sorted using Bucket sort recursively, then we get MSD Radix sort.
Also Counting sort is pretty similar to Pigeonhole sort, except it just counts the number of values in each bucket, instead of actually moving them to the bucket.

See more details: udiprod.com/radix-sort