Template:Sorting Algorithm: Difference between revisions
m (added two other sorts, fixed over-bracketing for two URL entries.) |
m (added a non-breaking blank.) |
||
| Line 26: | Line 26: | ||
[[Sorting algorithms/Bead sort|Bead sort]] | |
[[Sorting algorithms/Bead sort|Bead sort]] | |
||
[[Sorting algorithms/Bogosort|Bogo sort]] | |
[[Sorting algorithms/Bogosort|Bogo sort]] | |
||
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite |
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite structures sort] | |
||
[[Sorting algorithms/Counting sort|Counting sort]] | |
[[Sorting algorithms/Counting sort|Counting sort]] | |
||
[https://rosettacode.org/wiki/Sort_disjoint_sublist Disjoint sublist sort] | |
[https://rosettacode.org/wiki/Sort_disjoint_sublist Disjoint sublist sort] | |
||
Revision as of 07:57, 15 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 |
Composite structures sort |
Counting sort |
Disjoint sublist 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