I also love pdqsort. It has many of the same advantages, and has the advantage of being easier to implement (particularly if you already have a quicksort lying

I also love pdqsort. It has many of the same advantages, and has the advantage of being easier to implement (particularly if you already have a quicksort lying around). https://github.com/orlp/pdqsort https://github.com/orlp/pdqsort Basically, timsort is to mergesort as pdqsort is to quicksort.