Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
(Sort the sorts in the infobox by algorithmic efficiency) |
m (correct capitalization) |
||
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/Heapsort|Heapsort]] | [[Sorting algorithms/Merge sort|Mergesort]] | [[Sorting algorithms/Quicksort|Quicksort]]<br><b>O(''n'' log<sup>2</sup>''n'') Sorts</b><br>[[Sorting algorithms/Shell sort|Shell Sort]]<br><b>O(''n''<sup>2</sup>) Sorts</b><br>[[Sorting algorithms/Bubble sort|Bubble
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
|
Revision as of 00:16, 7 November 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