Along the same lines, I use Christopher Swenson's sort.h at https://github.com/swenson/sort/ https://github.com/swenson/sort/ You get the choice of many sort

Along the same lines, I use Christopher Swenson's sort.h at https://github.com/swenson/sort/ https://github.com/swenson/sort/ You get the choice of many sorting routines, including: Timsort (stable) Quicksort Merge sort (stable) In-place merge sort (not stable) Shellsort Binary insertion sort Heapsort Selection sort (this is really only here for comparison) Grail sort (stable) Sqrt Sort (stable, based on Grail sort, also by Andrey Astrelin).