Ok, thanks for taking the time anyway, it's appreciated 🙂

To be frank the library is not really the state of the art anymore when it comes to faster sorting algorithms. There's been a lot of research and faster sorting algorithms, even single-threaded ones, keep being released every other week. I'm thinking for example of in-place super scalar sample sort, which is old enough and quite fast. ska_sort itself has a more recent version somewhere (in a branch of boostorg/sort I think).

The algorithms that perform well on almost-sorted data in cpp-sort are "fun" and really interesting from a theoretical point of view, but most of them are slow in most situations, which makes them poor generic algorithms. I do hope that I will have another period of strong motivation for the project in the future, because I'm still not done exploring and improving everything I want to explore and improve in the area 😄