Show HN: Deorr – A Parallel Sort (github.com) 2 points by egz 1y ago ↗ HN Hi! This sort attempts to use N threads to sort a list of size N in O(n). That's at least what's hoped, but benchmarks prove this is difficult.
0 comments
[ 3.1 ms ] story [ 10.6 ms ] threadNo comments yet.