Jump to content

Pairwise sorting network

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2001:470:1f1b:1c7:9cc2:12c3:c364:d029 (talk) at 12:59, 2 June 2020 (External links: Mark link as dead). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Pairwise sorting network
Visualization of the Pairwise sorting network with 16 inputs
Visualization of the Pairwise sorting network with 16 inputs
ClassSorting algorithm
Data structureArray
Worst-case performance parallel time
Worst-case space complexity non-parallel time
OptimalNo

The pairwise sorting network is a sorting network discovered and published by Ian Parberry in 1992 in Parallel Processing Letters.[1] The pairwise sorting network has the same cost (number of comparators) and delay as the odd–even mergesort network. It requires comparators and has depth .

References

  1. ^ Parberry, Ian (1992), "The Pairwise Sorting Network" (PDF), Parallel Processing Letters, 2 (2, 3): 205–211