Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
(Fix Bead Sort link) |
(Sort the sorts in the infobox by algorithmic efficiency) |
||
Line 3:
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/
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
|
Revision as of 15:29, 31 August 2010
Sorting Algorithm
This is a sorting algorithm. It may be applied to a set of data in order to sort it.
Heapsort | Mergesort | Quicksort
O(n log2n) Sorts
Shell Sort
O(n2) Sorts
Bubble Sort | Cocktail Sort | Comb Sort | Gnome Sort | Insertion Sort | Selection Sort
Other Sorts
Bead Sort | Bogosort | Counting Sort | Pancake Sort | Permutation Sort | Stooge Sort