Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (put a category name on one line instead of splitting it.) |
m (uncapitalized some words.) |
||
Line 4:
For other sorting algorithms, see [[:Category:Sorting Algorithms|Category:sorting algorithms]], or:<br>
<small><center><b>[[O]](''n'' log''n'')
[[Sorting algorithms/Heapsort|Heapsort]] |
[[Sorting algorithms/Merge sort|Mergesort]] |
[[Sorting algorithms/Quicksort|Quicksort]]
<br><b>[[O]](''n'' log<sup>2</sup>''n'')
[[Sorting algorithms/Shell sort|Shell Sort]]<br>
<b>[[O]](''n''<sup>2</sup>)
[[Sorting algorithms/Bubble sort|Bubble sort]] |
[[Sorting algorithms/Cocktail sort|Cocktail sort]] |
Line 19:
[[Sorting algorithms/Selection sort|Selection sort]] |
[[Sorting algorithms/Strand sort|Strand sort]]
<br><b>
[[Sorting algorithms/Bead sort|Bead sort]] |
[[Sorting algorithms/Bogosort|Bogosort]] |
|
Revision as of 21:52, 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