Template:Sorting Algorithm

From Rosetta Code
Revision as of 13:44, 6 July 2020 by rosettacode>Gerard Schildberger (added "Tree sort" to list of sorting algorithms.)

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 | Cycle sort | Gnome sort | Insertion sort | Selection sort | Strand sort
other sorts
Bead sort | Bogosort | Counting sort | External sort | JortSort | lexicographical sort | OID sort | Pancake sort | [Quickselect] | Permutation sort | Radix sort | Sleep sort | Stooge sort | Three variable sort | Topological sort | Tree sort


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