Harold H. Seward

Harold H. Seward computer scientist and developer of the radix sort in 1954 at MIT.

In computer science radix sort is a fast, stable, sort algorithm which can be used to sort items that are identified by unique keys. Every key is a string or number, and radix sort sorts these keys in some particular lexicographic-like order. The algorithm operates in O(nk) time, where n is the number of items, and k is the average key length.