Radix Sort: Alternative radices
Our example used radix 10; each subkey was a digit.
Writing each key in binary, we can easily use radix 2.
A naturally efficient radix for strings of limited length would be 256; each 1-byte character serves as a subkey. (But, lexicographic ordering is not completely consistent with ASCII codes.)