Template:Sorting

v • d • e Sorting algorithms

Theory	Computational complexity theory \| Big O notation \| Total order \| Lists \| Stability \| Comparison sort

Exchange sorts	Bubble sort \| Cocktail sort \| Odd-even sort \| Comb sort \| Gnome sort \| Quicksort

Selection sorts	Selection sort \| Heapsort \| Smoothsort \| Strand sort

Insertion sorts	Insertion sort \| Shell sort \| Tree sort \| Library sort \| Patience sorting

Merge sorts	Merge sort

Non-comparison sorts	Radix sort \| Bucket sort \| Counting sort \| Pigeonhole sort \| Tally sort

Others	Topological sorting \| Sorting network \| Bitonic sorter

Ineffective/jokeful sorts	Bogosort