出典:Wikipedia
出典:『Wikipedia』 (2011/01/25 16:05 UTC 版)
The Pairwise sorting network is a sorting network discovered and published by Ian Parberry in 1992. The pairwise sorting network has the same cost (number of comparators) and delay as the odd-even mergesort network. It requires n(logn)(logn − 1) / 4 + n − 1 comparators and has depth (logn)(logn + 1) / 2.