Hacker News new | ask | show | jobs
by recursive 1107 days ago
70% better than O(N log N) is still O(N log N).
1 comments
ummonk 1107 days ago
It's 70% better than O(1). The algorithms it found are for sort3, sort4, and sort5, which were poorly optimized in LLVM's libc++.
link
pclmulqdq 1107 days ago
It may have also laundered those from open-source code that wanted to optimize sort3, sort4, and sort5.
link