Programming

I gave it a quick skim. It seems the improvements are on specific sort tasks. There may also be fitting to the distribution of sequences. It won’t beat n log(n) for all cases, but it might do better for common common situations in the data set.

It’s still neat they made it work.

My first thoughts were on the same line. I think the new "algorithm" are heuristics for small values of n.