Answers are grounded in this paper and cite their sources.
This paper develops sorting networks using the divide/sort/merge strategy. These networks require \[ (0.25)N( log _2 N )^2 - (0.386)N( log _2 N ) + O(N) \] comparison-interchanges to sort a list of length N. This is an improvement of order N(log ₂ N) over the best networks previously reported. (Using different methods, Van Voorhis [8] has improved upon these results.)
No takes yet. Share an insight, caveat, or question.
Drysdale et al. (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: