Template:Sorting Algorithm: Difference between revisions
m (added a related task.) |
m (added a related task, same category..) |
||
| Line 41: | Line 41: | ||
[[Sorting algorithms/Permutation sort|Permutation sort]] | |
[[Sorting algorithms/Permutation sort|Permutation sort]] | |
||
[[Sorting algorithms/Radix sort|Radix sort]] | |
[[Sorting algorithms/Radix sort|Radix sort]] | |
||
[[Ranking_methods|Ranking methods]] | |
|||
[https://rosettacode.org/wiki/Remove_duplicate_elements Remove duplicate elements] | |
[https://rosettacode.org/wiki/Remove_duplicate_elements Remove duplicate elements] | |
||
[[Sorting algorithms/Sleep sort|Sleep sort]] | |
[[Sorting algorithms/Sleep sort|Sleep sort]] | |
||
Revision as of 19:44, 24 March 2021
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 disjoint list items |
Order two numerical lists |
Object identifier (OID) sort |
Pancake sort |
Quickselect |
Permutation sort |
Radix sort |
Ranking methods |
Remove duplicate elements |
Sleep sort |
Stooge sort |
Three variable sort |
Topological sort |
Tree sort