Can Bin Sort be Adapted for Large N?
What if the range of possible keys is relatively large, but still bounded at some practical value like 10,000,000?
Can we still use Bin Sort effectively?
Yes, but in a new way. Break each key into a list of subkeys and perform one Bin Sort run for each subkey. This is called “radix sort”...