4 ms·
Cool! I should probably not have commented, I haven’t really kept up with advances in sorting, haha. I assumed it was basically done to death 20 years ago. This
by bee_rider 4y ago
Cool! I should probably not have commented, I haven’t really kept up with advances in sorting, haha. I assumed it was basically done to death 20 years ago. This will spur some reading I think! Thanks.
- anonymoushn 4y agoPlease do comment in situations like this. It's tough to find a good overview of this topic that includes recent work or that is aimed at empirical performance. That's part of why TFA is great! A version of MSB radix sort for sorting ints, doubles, or floats, or sorting structs by a single key of those types is here[0] and a version for sorting strings is here[1]. These are based on the MSB radix sort from this repository[2] which is associated with a technical report about parallel string sorts. I was only interested in sequential sorts, but this repository turned out to be a great resource anyway. [0]: https://github.com/alichraghi/zort/blob/main/src/radix.zig https://github.com/alichraghi/zort/blob/main/src/radix.zig [1]: https://github.com/dendibakh/perf-challenge6/blob/Solution_RobertBurke/wordcount.cpp#L411 https://github.com/dendibakh/perf-challenge6/blob/Solution_R... [2]: https://github.com/bingmann/parallel-string-sorting https://github.com/bingmann/parallel-string-sorting
- deleted 4y ago[deleted]