Integer sorting on a mesh-connected array of processors

Schnorr and Shamir and independently Kunde, have shown that sorting N=n/sup 2/ inputs into snake-like ordering on a n*n mesh requires 3n-o(n) steps. Using a less restrictive, more realistic model the author shows that the sorting N=n/sup 2/ integers in the range (1. . .N) can be performed in 2n+o(n) steps on a n*n mesh.<
>