Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
m (added a sort to the sorting template.)
m (added a sort to the sorting template.)
Line 25: Line 25:
[[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 JortSort] |
[[Sorting algorithms/Pancake sort|Pancake sort]] |
[[Sorting algorithms/Pancake sort|Pancake sort]] |
[[Sorting algorithms/Permutation sort|Permutation sort]] |
[[Sorting algorithms/Permutation sort|Permutation sort]] |

Revision as of 22:06, 22 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:

O(n logn) sorts

Heapsort | Mergesort | Quicksort
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 | Bogosort | Counting sort | External sort | JortSort | Pancake sort | Permutation sort | Radix sort | Sleep sort | Stooge sort | Topological sort


This is a template. There are many others. See Category:RCTemplates for a complete list of templates.