Pairwise sorting network

Pairwise sorting network
Visualization of the Pairwise sorting network with 16 inputs
Class	Sorting algorithm
Data structure	Array
Worst case performance	$(\log n)(\log n + 1)/2$ parallel time
Worst case space complexity	$n(\log n)(\log n - 1)/4 + n - 1$ comparators

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 $n(\log n)(\log n - 1)/4 + n - 1$ comparators and has depth $(\log n)(\log n + 1)/2$ .

References

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

External links

Sorting Networks – Web page by the author.

Sorting algorithms

Theory	Computational complexity theory Big O notation Total order Lists Inplacement Stability Comparison sort Adaptive sort Sorting network Integer sorting X + Y sorting Transdichotomous model Quantum sort

Exchange sorts	Bubble sort Cocktail shaker sort Odd–even sort Comb sort Gnome sort Quicksort Stooge sort Bogosort

Selection sorts	Selection sort Heapsort Smoothsort Cartesian tree sort Tournament sort Cycle sort

Insertion sorts	Insertion sort Shellsort Splaysort Tree sort Library sort Patience sorting

Merge sorts	Merge sort Cascade merge sort Oscillating merge sort Polyphase merge sort

Distribution sorts	American flag sort Bead sort Bucket sort Burstsort Counting sort Pigeonhole sort Proxmap sort Radix sort Flashsort

Concurrent sorts	Bitonic sorter Batcher odd–even mergesort Pairwise sorting network

Hybrid sorts	Block sort Timsort Introsort Spreadsort

Other	Topological sorting Pancake sorting Spaghetti sort

This article is issued from Wikipedia - version of the Saturday, December 26, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.