"Comparison." . . . . "Computer architecture." . . "CARNEGIE-MELLON UNIV PITTSBURGH PA Dept. of COMPUTER SCIENCE." . . "Arrays." . . "Data processing equipment." . . "Computer Hardware." . . "Addressing." . . "Mesh." . . "Sorting." . . "Networks." . . "Routing." . . "Parallel processors." . . "Computer Systems." . . . . . . . "Sorting on a mesh-connected parallel computer" . "Sorting on a mesh-connected parallel computer"@en . . . . . . . . . . . . . . . . . . . . . . . . . . . "Two algorithms are presented for sorting M to the 2nd power elements on an nxn mesh-connected processor array that require O(n) routing and comparison steps. The best previous algorithm 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 mesh-connected processor arrays are also given. (Author)."@en . "Sorting on a Mesh-Connected Parallel Computer"@en . "Sorting machines." . . "Algorithms." . .