3 ms·
There's C++ code included – great! But no actual timings :( I'd be curious to see a deeper discussion of practical run-times, in actual seconds, relative to ot
by Radim 5y ago
There's C++ code included – great! But no actual timings :(
I'd be curious to see a deeper discussion of practical run-times, in actual seconds, relative to other popular sorting algorithms. Especially if driven by a real task with well-motivated problem constraints. (As opposed to "1000 random integers!" micro-benchmarks, or "N goes to infinity" theoretical big-Ohs.)
I personally find practical benchmarks the most exciting. They also help me identify different niches for different algos (caching, locality, array sizes, parallelization…).
- Ono-Sendai 5y agoHere are some perf measurements I made a while ago with a serial and a parallel radix sort: https://forwardscattering.org/post/34 https://forwardscattering.org/post/34
- vitorsr 5y agoThe following repository implements radix sorting algorithms “from the ground up” and includes some benchmarks: https://github.com/eloj/radix-sorting#cpp-benchmark https://github.com/eloj/radix-sorting#cpp-benchmark
- bssrdf 5y agoI implemented radix sort in cpython [0] and did some simple benchmarking comparing to python' built-in sort (Timsort I believe). It is indeed faster. [0] https://github.com/bssrdf/RadixSortPy https://github.com/bssrdf/RadixSortPy