Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (added "Patience sort" to the sorting algorithm.) |
m (elided a blank line.) |
||
| Line 1: | Line 1: | ||
<div class="infobox" style="width: 2in"> |
<div class="infobox" style="width: 2in"> |
||
<big>'''Sorting Algorithm'''</big><br> |
<big>'''Sorting Algorithm'''</big><br> |
||
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. |
||
| ⚫ | |||
| ⚫ | |||
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
||
[[Sorting algorithms/Heapsort|Heap sort]] | |
[[Sorting algorithms/Heapsort|Heap sort]] | |
||
Revision as of 15:13, 6 July 2020
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:
Heap sort | Merge sort | Patience sort | Quick sort
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 |
Bogo sort |
Counting sort |
External sort |
Jort Sort |
lexicographical sort |
Natural sorting |
Object identifier (OID) sort |
Pancake sort |
[Quickselect] |
Permutation sort |
Radix sort |
Sleep sort |
Stooge sort |
Three variable sort |
Topological sort |
Tree sort