Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (added "Tree sort" to list of sorting algorithms.) |
m (added "Patience sort" to the sorting algorithm.) |
||
Line 5: | Line 5: | ||
For other sorting algorithms, see [[:Category:Sorting Algorithms|Category:sorting algorithms]], or:<br> |
For other sorting algorithms, see [[:Category:Sorting Algorithms|Category:sorting algorithms]], or:<br> |
||
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
<small><center><b>[[O]](''n'' log''n'') sorts</b><br> |
||
[[Sorting algorithms/Heapsort| |
[[Sorting algorithms/Heapsort|Heap sort]] | |
||
[[Sorting algorithms/Merge sort| |
[[Sorting algorithms/Merge sort|Merge sort]] | |
||
[[Sorting algorithms/ |
[[Sorting algorithms/Patience sort|Patience sort]] | |
||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
[[Sorting algorithms/Shell sort|Shell Sort]] |
|||
<b>[[O]](''n''<sup>2</sup>) sorts</b><br> |
<b>[[O]](''n''<sup>2</sup>) sorts</b><br> |
||
[[Sorting algorithms/Bubble sort|Bubble sort]] | |
[[Sorting algorithms/Bubble sort|Bubble sort]] | |
||
Line 20: | Line 23: | ||
[[Sorting algorithms/Selection sort|Selection sort]] | |
[[Sorting algorithms/Selection sort|Selection sort]] | |
||
[[Sorting algorithms/Strand sort|Strand sort]] |
[[Sorting algorithms/Strand sort|Strand sort]] |
||
<b>other sorts</b><br> |
|||
[[Sorting algorithms/Bead sort|Bead sort]] | |
[[Sorting algorithms/Bead sort|Bead sort]] | |
||
[[Sorting algorithms/Bogosort| |
[[Sorting algorithms/Bogosort|Bogo sort]] | |
||
[[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 |
[https://rosettacode.org/wiki/JortSort Jort Sort] | |
||
[https://rosettacode.org/wiki/Sort_numbers_lexicographically lexicographical sort] | |
[https://rosettacode.org/wiki/Sort_numbers_lexicographically lexicographical sort] | |
||
[https://rosettacode.org/wiki/ |
[https://rosettacode.org/wiki/Natural_sorting Natural sorting] | |
||
[https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers Object identifier (OID) sort] | |
|||
[[Sorting algorithms/Pancake sort|Pancake sort]] | |
[[Sorting algorithms/Pancake sort|Pancake sort]] | |
||
[[https://rosettacode.org/wiki/Quickselect_algorithm Quickselect]] | |
[[https://rosettacode.org/wiki/Quickselect_algorithm Quickselect]] | |
Revision as of 14:16, 6 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 |
Counting 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