Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
m (elided a blank line.)
m (added two other sorts, fixed over-bracketing for two URL entries.)
Line 26: Line 26:
[[Sorting algorithms/Bead sort|Bead sort]] |
[[Sorting algorithms/Bead sort|Bead sort]] |
[[Sorting algorithms/Bogosort|Bogo sort]] |
[[Sorting algorithms/Bogosort|Bogo sort]] |
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite structures sort] |
[[Sorting algorithms/Counting sort|Counting sort]] |
[[Sorting algorithms/Counting sort|Counting sort]] |
[https://rosettacode.org/wiki/Sort_disjoint_sublist Disjoint sublist sort] |
[https://rosettacode.org/wiki/External_sort External sort] |
[https://rosettacode.org/wiki/External_sort External sort] |
[https://rosettacode.org/wiki/JortSort Jort Sort] |
[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/Natural_sorting Natural sorting] |
[https://rosettacode.org/wiki/Natural_sorting Natural sorting] |
[https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers Object identifier (OID) sort] |
[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] |
[[Sorting algorithms/Permutation sort|Permutation sort]] |
[[Sorting algorithms/Permutation sort|Permutation sort]] |
[[Sorting algorithms/Radix sort|Radix sort]] |
[[Sorting algorithms/Radix sort|Radix sort]] |

Revision as of 07:54, 15 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:

O(n logn) sorts

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 | Composite structures sort | Counting sort | Disjoint sublist 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

This is a template. There are many others. See Category:RCTemplates for a complete list of templates.
Retrieved from "https://rosettacode.org/wiki/Template:Sorting_Algorithm?oldid=11460"