Show HN: Deorr – A Parallel Sort (github.com)

2 points by egz ↗ 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

[ 5.1 ms ] story [ 12.4 ms ] thread

No comments yet.