Template:Sorting Algorithm: Difference between revisions
Content added Content deleted
m (split a header text.) |
m (put a category name on one line instead of splitting it.) |
||
Line 1:
<div class="infobox" style="width: 2in">
<big>'''Sorting Algorithm'''</big><br>
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|Category:sorting algorithms]], or:<br>
<small><center><b>[[O]](''n'' log''n'') Sorts</b><br>
[[Sorting algorithms/Heapsort|Heapsort]] |
|
Revision as of 21:46, 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