Hillmore's modification), it would take 13 q-7 -I-7 q-1 q-1 q-1 q-1 = 31 comparisons to sort an array of length eleven. If, in addition, the splitting routine uses only k = n comparisons per scan, then only 11 q-5 q-5 q-1 q-1 q-1 + 1 = 25 comparisons would be needed to sort that same array.
No takes yet. Share an insight, caveat, or question.
Thomas Wright (1974) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: