Template:Sorting Algorithm: Difference between revisions
m (added a related task.) |
m (added: for seeing other sorts ...) |
||
Line 1: | Line 1: | ||
<div class="infobox" style="width: 2in"> |
<div class="infobox" style="width: 2in"> |
||
<big>'''Sorting Algorithm'''</big><br> |
<big>'''Sorting Algorithm'''</big><br> |
||
This is a sorting algorithm. It may be applied to a set of data in order to sort it. |
This is a sorting algorithm. It may be applied to a set of data in order to sort it. |
||
For comparing various sorts, see [https://rosettacode.org/wiki/Compare_sorting_algorithms%27_performance compare sorts]. |
|||
For other sorting algorithms, see [[:Category:Sorting Algorithms| |
For other sorting algorithms, see [[:Category:Sorting Algorithms|sorting algorithms]], or: |
||
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
||
[[Sorting algorithms/Heapsort|Heap sort]] | |
[[Sorting algorithms/Heapsort|Heap sort]] | |
Latest revision as of 23:31, 17 August 2021
Sorting Algorithm
This is a sorting algorithm. It may be applied to a set of data in order to sort it.
For comparing various sorts, see compare sorts.
For other sorting algorithms, see 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 |
Common sorted list |
Composite structures sort |
Custom comparator sort |
Counting sort |
Disjoint sublist sort |
External sort |
Jort sort |
Lexicographical sort |
Natural sorting |
Order by pair comparisons |
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 |
[Sort letters of a string] |
Three variable sort |
Topological sort |
Tree sort