Bitonic sorter

From Wikipedia, the free encyclopedia

Please help improve this article or section by expanding it. Further information might be found on the talk page or at requests for expansion. (January 2007)

Bitonic sort is a sorting algorithm designed specially for parallel machines.

A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is composed of two subsequences, one monotonically non-decreasing and the other monotonically non-increasing. A "V" and an A-frame are examples of bitonic sequences.

[edit] External links

• A discussion of this algorithm
• Reference code at NIST
• Excellent tutorial with animated pictures and working code
• Experimental Analysis of Parallel Sorting Algorithms

v • d • e Sorting algorithms Theory Computational complexity theory | Big O notation | Total order | Lists | Stability | Comparison sort Exchange sorts Bubble sort | Cocktail sort | Odd-even sort | Comb sort | Gnome sort | Quicksort Selection sorts Selection sort | Heapsort | Smoothsort | Strand sort Insertion sorts Insertion sort | Shell sort | Tree sort | Library sort | Patience sorting Merge sorts Merge sort Non-comparison sorts Radix sort | Bucket sort | Counting sort | Pigeonhole sort | Tally sort Others Topological sorting | Sorting network | Bitonic sorter Ineffective/jokeful sorts Bogosort