Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (added a sort algorithm.) |
m (added "Tree sort" to list of sorting algorithms.) |
||
Line 35:
[[Sorting algorithms/Stooge sort|Stooge sort]] |
[https://rosettacode.org/wiki/Sort_three_variables Three variable sort] |
[https://rosettacode.org/wiki/Topological_sort Topological sort] |
[[Sorting algorithms/Tree sort on a linked list|Tree sort]]
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude>
|
Revision as of 13:44, 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:
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