Who Invented Radix Sort?

For use with one of his Hollerith machines of the late 1800s, Herman Hollerith developed an algorithm called Radix sort because it depends on multiple sort passes, one for each digit (radix) position in the maximum value number to be sorted.

When was radix sort invented?

A radix sorting algorithm was originally used to sort punched cards in several passes. A computer algorithm was invented for radix sort in 1954 at MIT by Harold H.

Which algorithm is used for radix sort?

Here comes the idea of Radix Sort. Sort input array using countsort algorithm according to ith digit. We used count sort because it is a stable sort. Based on the algorithm, we will sort the input array according to the one's digit (least significant digit).