[birdbrain]

The concept is interesting, but I'm a little leery of the detail that the benchmark performance reported is in each case "the best run out of 100".

One can claim, thus, only that this sort method's near-best-case performance is better than `std::sort`'s near-best-case performance (at least at the, er, P01 level). That says little to nothing about the modal or reasonably-bad-case (say, P95) performance.

A comparison of median values would lend much more weight to the claim that this method is "faster" than `std::sort`.

But a really good benchmark report would show the entire histogram of performance for each method.

[BugsJustFindMe]

Average is reported in the data table as well. In every case average is exceptionally close to best, leading me to believe that your interpretation of "the best run" is incorrect and that it's merely eliminating system jitter not looking at different data.