Template:Sorting Algorithm: Difference between revisions
m (changed capitalization.) |
m (added topological sort.) |
||
Line 44: | Line 44: | ||
[https://rosettacode.org/wiki/Sort_three_variables Three variable sort] | |
[https://rosettacode.org/wiki/Sort_three_variables Three variable sort] | |
||
[https://rosettacode.org/wiki/Topological_sort Topological sort] | |
[https://rosettacode.org/wiki/Topological_sort Topological sort] | |
||
[https://rosettacode.org/wiki/Topological_sort/Extracted_top_item Topological sort,extract top item] | |
|||
[[Sorting algorithms/Tree sort on a linked list|Tree sort]] |
[[Sorting algorithms/Tree sort on a linked list|Tree sort]] |
||
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude> |
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude> |
Revision as of 20:09, 27 August 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 |
Composite structures sort |
Custom comparator sort |
Counting sort |
Disjoint sublist sort |
External sort |
Jort sort |
Lexicographical sort |
Natural sorting |
Order two numerical lists |
Object identifier (OID) sort |
Pancake sort |
Quickselect |
Permutation sort |
Radix sort |
Sleep sort |
Stooge sort |
Three variable sort |
Topological sort |
Topological sort,extract top item |
Tree sort