Various MSD radix sorting implementations, for fun and evaluation.

The plan is for some to eventually join my Notes on Radix Sorting and Implementation repository.

All code is provided under the MIT License.

• CE is for Count, External memory.
• CI is for Count, In-place.
• CB have merged C (count) and B (bucket) arrays.
• BM Use bitmaps for loop iteration.

None of the current implementations are really competitive, especially considering the extra space for the non-inplace variants. For sure, the memory access pattern is suboptimal for modern architectures, especially at relatively low radixes (i.e 8 bits).

• [TM18] Timo Bingmann, "Scalable String and Suffix Sorting", 2018.