Now I remember, it was a college try to improve the read operation of insertion-class sort algorithm. One guy knocked down the time order considerably by doing

Now I remember, it was a college try to improve the read operation of insertion-class sort algorithm. One guy knocked down the time order considerably by doing tiny pre-bubblesort in blocks before entering into the link-insertion thereby making less passes over its million link-list chains: but only because he leveraged to fitting within its CPU L2/L3 cache. Professor said that the order got worse but not by huge logarithmic scale despite time speed-ups for completion. Dang, the O order just got complicated for multi-level caches.