Template:Sorting Algorithm

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

Heap sort | Merge sort | Patience sort | Quick sort

O(n log²n) sorts
Shell Sort

O(n²) 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 | Bogo sort | Composite structures sort | Custom comparator sort | Counting sort | Disjoint sublist sort | External sort | Jort sort | Lexicographical sort | Natural sorting | Order disjoint list items | Order two numerical lists | Object identifier (OID) sort | Pancake sort | Quickselect | Permutation sort | Radix sort | Remove duplicate elements | 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.