Radix Sort is a relatively old being discovered in 1887 by Herman Hollerith, and it is a non-comparitive integer sorting algorithm. In many ways Radix Sort in C is an extension of Counting Sort in C, which I recommend reviewing as well, as it will provide must of the background for Radix Sort. Radix Sort The algorithm follows the […]
Every day in cities such as Chicago, New York, Tokyo, Singapore, Hong Kong and more, millions of people attempt to leave their buildings via elevator. However, very rarely do we consider how elevators are allocated to provide service, especially during rush hour(s), when most of the building will attempt to exit in a matter of […]
Radix Sort is a relatively old (discovered in 1887 by Herman Hollerith), non-comparitive integer sorting algorithm, which sorts data by comparing various integers individual digit position and value. In many ways Radix Sort in Go reflects and builds off Counting Sort, and I recommend reviewing that algorithm as well. Radix Sort Essentially, the algorithm is is […]