Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
(Fix Bead Sort link)
(Sort the sorts in the infobox by algorithmic efficiency)
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>[[Sorting algorithms/Bead Sort|Bead Sort]] | [[Sorting algorithms/Bogosort|Bogosort]] | [[Sorting algorithms/Bubble sort|Bubble&nbsp;Sort]] | [[Sorting algorithms/Cocktail sort|Cocktail&nbsp;Sort]] | [[Sorting algorithms/Comb sort|Comb&nbsp;Sort]] | [[Sorting algorithms/Counting sort|Counting&nbsp;Sort]] | [[Sorting algorithms/Gnome sort|Gnome&nbsp;Sort]] | [[Sorting algorithms/Heapsort|Heapsort]] | [[Sorting algorithms/Insertion sort|Insertion&nbsp;Sort]] | [[Sorting algorithms/Merge sort|Mergesort]] | [[Sorting algorithms/Permutation sort|Permutation&nbsp;Sort]] | [[Sorting algorithms/Quicksort|Quicksort]] | [[Sorting algorithms/Selection sort|Selection&nbsp;Sort]] | [[Sorting algorithms/Shell sort|Shell&nbsp;Sort]] | [[Sorting algorithms/Stooge sort|Stooge&nbsp;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&nbsp;Sort]]<br><b>O(''n''<sup>2</sup>) Sorts</b><br>[[Sorting algorithms/Bubble sort|Bubble&nbsp;Sort]] | [[Sorting algorithms/Cocktail sort|Cocktail&nbsp;Sort]] | [[Sorting algorithms/Comb sort|Comb&nbsp;Sort]] | [[Sorting algorithms/Gnome sort|Gnome&nbsp;Sort]] | [[Sorting algorithms/Insertion sort|Insertion&nbsp;Sort]] | [[Sorting algorithms/Selection sort|Selection&nbsp;Sort]]<br><b>Other Sorts</b><br>[[Sorting algorithms/Bead Sort|Bead&nbsp;Sort]] | [[Sorting algorithms/Bogosort|Bogosort]] | [[Sorting algorithms/Counting sort|Counting&nbsp;Sort]] | [[Sorting algorithms/Pancake sort|Pancake&nbsp;Sort]] | [[Sorting algorithms/Permutation sort|Permutation&nbsp;Sort]] | [[Sorting algorithms/Stooge sort|Stooge&nbsp;Sort]]</center></small>
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
</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.

For other sorting algorithms, see Category:Sorting Algorithms, or:
O(n logn) Sorts
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
This is a template. There are many others. See Category:RCTemplates for a complete list of templates.
Retrieved from "https://rosettacode.org/wiki/Template:Sorting_Algorithm?oldid=11434"