Binary Radix Sort

Exploring radix sort. Radix sort has the reputation of being the fastest algorithm to sort through millions of integers in the computing literature. It has a complexity of \mathcal{O}(nk) where n is the number of elements, and k is the element’s length.

I modified the version on the Wikipedia to use binary representation to sort the unsigned integers. Here is my version in C#: