BRIEF update 28 Sep 2025: this codebase is almost certainly in a BROKEN state; i got stuck trying to multi-process-ify it. it's probably not too far from kinda-working, but it is messily halfway ...

This repo implements radix sort as a sup::sort() function, which takes the beginning and end iterator of a container which you want to sort. This works as a drop-in replacement for the std::sort() ...

Abstract: We show the importance of sequential sorting in the context of in-memory parallel sorting of large data sets of 64-bit keys. First, we analyze several sequential strategies, like Straight ...