Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (Linkify big O) |
(Add strand sort) |
||
| Line 3: | Line 3: | ||
This is a sorting algorithm. It may be applied to a set of data in order to sort it. |
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> |
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]] | [[Sorting algorithms/Strand sort|Strand 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> |
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude> |
||
Revision as of 17:39, 5 May 2011
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 | Strand sort
Other Sorts
Bead sort | Bogosort | Counting sort | Pancake sort | Permutation sort | Radix sort | Stooge sort