Answers are grounded in this paper and cite their sources.
The need for sorting algorithms which operate in a fixed number of rounds (rather than have each new comparison depend on the outcomes of all previous comparisons) arises in structural modeling. Since all comparisons within a round are evaluated simultaneously, such algorithms have an obvious connection to parallel processing. In an earlier paper (SIAM J. Comput.,10 (1981), pp. 465–472) we used a counting argument to prove the existence of subquadratic sorting algorithms for two rounds. Here we develop optimal algorithms for merging in rounds, and apply them to actually construct good sorting algorithms for k rounds, k 3. For example, in $k = 66$ rounds, our algorithm will sort any n-element linearly ordered set with O ( n1.10 ) comparisons.
No takes yet. Share an insight, caveat, or question.
Häggkvist et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: