Pairwise sorting network
Visualization of the Pairwise sorting network with 16 inputs
|Worst case performance||parallel time|
|Worst case space complexity||comparators|
The pairwise sorting network is a sorting network discovered and published by Ian Parberry in 1992 in Parallel Processing Letters. 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 .
- Parberry, Ian (1992), "The Pairwise Sorting Network", Parallel Processing Letters 2 (2,3): 205–211
- Sorting Networks – Web page by the author.
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|