Answers are grounded in this paper and cite their sources.
In a recent note 1 , D. L. Shell has described a high-speed sorting procedure for lists contained in internal memory. The method has the great virtues of requiring no additional memory space and being considerably faster than other such methods, which require a time proportional to the square of the list length. The present authors have studied the statistics of Shell's method and have found a minor modification which increases its speed still further.
No takes yet. Share an insight, caveat, or question.
Frank et al. (1960) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: