Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (added a sort to the sorting algorhithms.) |
m (split a header text.) |
||
| Line 19: | Line 19: | ||
[[Sorting algorithms/Selection sort|Selection sort]] | |
[[Sorting algorithms/Selection sort|Selection sort]] | |
||
[[Sorting algorithms/Strand sort|Strand sort]] |
[[Sorting algorithms/Strand sort|Strand sort]] |
||
<br><b>Other Sorts</b> |
<br><b>Other Sorts</b><br> |
||
[[Sorting algorithms/Bead sort|Bead sort]] | |
|||
[[Sorting algorithms/Bogosort|Bogosort]] | |
[[Sorting algorithms/Bogosort|Bogosort]] | |
||
[[Sorting algorithms/Counting sort|Counting sort]] | |
[[Sorting algorithms/Counting sort|Counting sort]] | |
||
Revision as of 00:44, 10 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 |
Gnome sort |
Insertion sort |
Selection sort |
Strand sort
Other Sorts
Bead sort |
Bogosort |
Counting sort |
Pancake sort |
Permutation sort |
Radix sort |
Sleep sort |
Stooge sort