From: Malte Skarupke (malteskarupke_at_[hidden])
Date: 2020-01-22 17:23:42
I started a discussion about this in October, but at the time the maintainer of the sort library was busy, then I was busy, so now it's January...
I wrote a generalized version of radix sort a couple years ago and gave a talk about it here:
I would like to get a new version of that sorting algorithm into boost. It's faster than what I showed several years ago. It's also even more general and has a new interface that should be easier to extend. I uploaded the code here:
The documentation is also already updated with new benchmark results.
Let me know what's required to get this into boost. Would you like this in the form of a pull request?
One of the big things that probably needs review is the interface, since radix sorting works differently than comparison based sorting. For most normal uses you just need to provide a sort key, but more complicated cases can get more complicated. I tried very hard to make everything easy, but I'd also be curious if others can come up with better ways of doing the interface.
-- Malte Skarupke malteskarupke_at_[hidden]
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk