Two algorithms are presented for sorting n 2 elements on an n × n mesh-connected processor array that require O (n) routing and comparison steps. The best previous algoritmhm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional arrays are also given.
No takes yet. Share an insight, caveat, or question.
Thompson et al. (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: