I did a quick Google search for pdqsort and found this HN post: https://news.ycombinator.com/item?id=14666710 https://news.ycombinator.com/item?id=14666710 > I

I did a quick Google search for pdqsort and found this HN post: https://news.ycombinator.com/item?id=14666710 https://news.ycombinator.com/item?id=14666710 > I think it's fair to say that pdqsort (pattern-defeating quicksort) is overall the best unstable sort and timsort is overall the best stable sort in 2017, at least if you're implementing one for a standard library. _hrfd called it 5 years ago.