Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
(Added heapsort, tinkered with formatting)
(Added comb 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>[[Bogosort]] | [[Bubble Sort|Bubble&nbsp;Sort]] | [[Cocktail Sort|Cocktail&nbsp;Sort]] | [[Counting sort|Counting&nbsp;Sort]] | [[Gnome sort|Gnome&nbsp;Sort]] | [[Heapsort]] | [[Insertion sort|Insertion&nbsp;Sort]] | [[Merge sort|Mergesort]] | [[Permutation Sort|Permutation&nbsp;Sort]] | [[Quicksort]] | [[Selection sort|Selection&nbsp;Sort]] | [[Shell sort|Shell&nbsp;Sort]]</center></small>
For other sorting algorithms, see [[:Category:Sorting Algorithms]], or:<br><small><center>[[Bogosort]] | [[Bubble Sort|Bubble&nbsp;Sort]] | [[Cocktail Sort|Cocktail&nbsp;Sort]] | [[Comb sort|Comb&nbsp;Sort]] | [[Counting sort|Counting&nbsp;Sort]] | [[Gnome sort|Gnome&nbsp;Sort]] | [[Heapsort]] | [[Insertion sort|Insertion&nbsp;Sort]] | [[Merge sort|Mergesort]] | [[Permutation Sort|Permutation&nbsp;Sort]] | [[Quicksort]] | [[Selection sort|Selection&nbsp;Sort]] | [[Shell sort|Shell&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 23:42, 25 January 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:
Bogosort | Bubble Sort | Cocktail Sort | Comb Sort | Counting Sort | Gnome Sort | Heapsort | Insertion Sort | Mergesort | Permutation Sort | Quicksort | Selection Sort | Shell Sort

This is a template. There are many others. See Category:RCTemplates for a complete list of templates.