Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (added a sort entry.) |
m (changed whitespace.) |
||
Line 25: | Line 25: | ||
[[Sorting algorithms/Counting sort|Counting sort]] | |
[[Sorting algorithms/Counting sort|Counting sort]] | |
||
[https://rosettacode.org/wiki/External_sort External sort] | |
[https://rosettacode.org/wiki/External_sort External sort] | |
||
[https://rosettacode.org/wiki/JortSort JortSort] | |
[https://rosettacode.org/wiki/JortSort JortSort] | |
||
[https://rosettacode.org/wiki/Sort_numbers_lexicographically lexicographical sort] | |
[https://rosettacode.org/wiki/Sort_numbers_lexicographically lexicographical sort] | |
Revision as of 19:10, 31 May 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 |
Permutation sort |
Radix sort |
Sleep sort |
Stooge sort |
Topological sort