Anonymous user
Template:Sorting Algorithm: Difference between revisions
m
Linkify big O
(Added radix sort to list) |
m (Linkify big O) |
||
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 sort]] | [[Sorting algorithms/Cocktail sort|Cocktail sort]] | [[Sorting algorithms/Comb sort|Comb sort]] | [[Sorting algorithms/Gnome sort|Gnome sort]] | [[Sorting algorithms/Insertion sort|Insertion sort]] | [[Sorting algorithms/Selection sort|Selection sort]]<br><b>Other Sorts</b><br>[[Sorting algorithms/Bead sort|Bead sort]] | [[Sorting algorithms/Bogosort|Bogosort]] | [[Sorting algorithms/Counting sort|Counting sort]] | [[Sorting algorithms/Pancake sort|Pancake sort]] | [[Sorting algorithms/Permutation sort|Permutation sort]] | [[Sorting algorithms/Radix sort|Radix sort]] | [[Sorting algorithms/Stooge sort|Stooge sort]]</center></small>
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
| |||