|
|
|
This is a sorting algorithm. It may be applied to a set of data in order to sort it.
For other sorting algorithms, see [[:Category:Sorting Algorithms]], or:<br><small><center><b>O(''n'' log''n'') Sorts</b><br>[[Sorting algorithms/BeadHeapsort|Heapsort]] Sort|Bead Sort[[Sorting algorithms/Merge sort|Mergesort]] | [[Sorting algorithms/BogosortQuicksort|BogosortQuicksort]]<br><b>O(''n'' |log<sup>2</sup>''n'') Sorts</b><br>[[Sorting algorithms/BubbleShell sort|BubbleShell Sort]]<br><b>O(''n''<sup>2</sup>) | Sorts</b><br>[[Sorting algorithms/CocktailBubble sort|CocktailBubble Sort]] | [[Sorting algorithms/CombCocktail sort|CombCocktail Sort]] | [[Sorting algorithms/CountingComb sort|CountingComb Sort]] | [[Sorting algorithms/Gnome sort|Gnome Sort]] | [[Sorting algorithms/HeapsortInsertion sort|HeapsortInsertion Sort]] | [[Sorting algorithms/InsertionSelection sort|InsertionSelection Sort]]<br><b>Other | Sorts</b><br>[[Sorting algorithms/MergeBead sortSort|MergesortBead Sort]] | [[Sorting algorithms/Permutation sortBogosort|Permutation SortBogosort]] | [[Sorting algorithms/QuicksortCounting sort|QuicksortCounting Sort]] | [[Sorting algorithms/SelectionPancake sort|SelectionPancake Sort]] | [[Sorting algorithms/ShellPermutation sort|ShellPermutation Sort]] | [[Sorting algorithms/Stooge sort|Stooge Sort]]</center></small>
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
|