Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
(Added Stooge Sort)
(Added Bead Sort to the list)
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/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>[[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>
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
</div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>

Revision as of 09:11, 26 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:
Bead Sort | Bogosort | Bubble Sort | Cocktail Sort | Comb Sort | Counting Sort | Gnome Sort | Heapsort | Insertion Sort | Mergesort | Permutation Sort | Quicksort | Selection Sort | Shell 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=11432"