Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Try this again, remove non-algorithms from sort-algorithm template)
m (added a sort to the sorting algorhithms.)
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>
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]] | [[Sorting algorithms/Strand sort|Strand&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/Radix sort|Radix&nbsp;sort]] | [[Sorting algorithms/Sleep sort|Sleep&nbsp;sort]] | [[Sorting algorithms/Stooge sort|Stooge&nbsp;sort]] </center></small>
<small><center><b>[[O]](''n'' log''n'') Sorts</b><br>
⚫
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
[[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/Cocktail sort with shifting bounds|Cocktail&nbsp;sort&nbsp;with&nbsp;shifting&nbsp;bounds]] |
[[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]] |
[[Sorting algorithms/Strand sort|Strand&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/Radix sort|Radix&nbsp;sort]] |
[[Sorting algorithms/Sleep sort|Sleep&nbsp;sort]] |
[[Sorting algorithms/Stooge sort|Stooge&nbsp;sort]]
⚫
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>

Revision as of 00:40, 10 May 2020

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 | Cocktail sort with shifting bounds | Comb sort | Gnome sort | Insertion sort | Selection sort | Strand sort
Other Sorts
Bead sort | Bogosort | Counting sort | Pancake sort | Permutation sort | Radix sort | Sleep 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=11446"