Distributed Sorting

of its two neighbors per iteration, but with both (as long as necessary). The other diierence is that our algorithms are smooth in the sense that the execution time is much less for almost-sorted arrays than for hardly-sorted arrays, with a smooth transition from one to the other behavior. This is due to the conditions under which processes engage in communications.