Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
m (uncapitalized a word.)
m (added: for seeing other sorts ...)
 
(10 intermediate revisions by the same user not shown)
Line 1: Line 1:
<div class="infobox" style="width: 2in">
<div class="infobox" style="width: 2in">
<big>'''Sorting Algorithm'''</big><br>
<big>'''Sorting Algorithm'''</big><br>
This is a sorting algorithm. &nbsp; It may be applied to a set of data in order to sort it. &nbsp;
This is a sorting algorithm. &nbsp; It may be applied to a set of data in order to sort it. &nbsp; &nbsp;
For comparing various sorts, see [https://rosettacode.org/wiki/Compare_sorting_algorithms%27_performance compare sorts]. &nbsp;
For other sorting algorithms, see [[:Category:Sorting Algorithms|Category:sorting&nbsp;algorithms]], or:
For other sorting algorithms, &nbsp; see [[:Category:Sorting Algorithms|sorting&nbsp;algorithms]], &nbsp; or:
<small><center><b>[[O]](''n'' log''n'') sorts</b><br>
<small><center><b>[[O]](''n'' log''n'') sorts</b><br>
[[Sorting algorithms/Heapsort|Heap&nbsp;sort]] |
[[Sorting algorithms/Heapsort|Heap&nbsp;sort]] |
Line 26: Line 27:
[[Sorting algorithms/Bead sort|Bead&nbsp;sort]] |
[[Sorting algorithms/Bead sort|Bead&nbsp;sort]] |
[[Sorting algorithms/Bogosort|Bogo&nbsp;sort]] |
[[Sorting algorithms/Bogosort|Bogo&nbsp;sort]] |
[https://rosettacode.org/wiki/Common_sorted_list Common&nbsp;sorted&nbsp;list] |
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite&nbsp;structures&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite&nbsp;structures&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_using_a_custom_comparator Custom&nbsp;comparator&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_using_a_custom_comparator Custom&nbsp;comparator&nbsp;sort] |
Line 34: Line 36:
[https://rosettacode.org/wiki/Sort_numbers_lexicographically Lexicographical&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_numbers_lexicographically Lexicographical&nbsp;sort] |
[https://rosettacode.org/wiki/Natural_sorting Natural&nbsp;sorting] |
[https://rosettacode.org/wiki/Natural_sorting Natural&nbsp;sorting] |
[https://rosettacode.org/wiki/Order_by_pair_comparisons Order&nbsp;by&nbsp;pair&nbsp;comparisons] |
[https://rosettacode.org/wiki/Order_disjoint_list_items Order&nbsp;disjoint&nbsp;list&nbsp;items] |
[https://rosettacode.org/wiki/Order_two_numerical_lists Order&nbsp;two&nbsp;numerical&nbsp;lists] |
[https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers Object&nbsp;identifier&nbsp;(OID)&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers Object&nbsp;identifier&nbsp;(OID)&nbsp;sort] |
[[Sorting algorithms/Pancake sort|Pancake&nbsp;sort]] |
[[Sorting algorithms/Pancake sort|Pancake&nbsp;sort]] |
[https://rosettacode.org/wiki/Quickselect_algorithm Quickselect] |
[https://rosettacode.org/wiki/Quickselect_algorithm Quickselect] |
[[Sorting algorithms/Permutation sort|Permutation&nbsp;sort]] |
[[Sorting algorithms/Permutation sort|Permutation&nbsp;sort]] |
[[Sorting algorithms/Radix sort|Radix&nbsp;sort]] |
[[Sorting algorithms/Radix sort|Radix&nbsp;sort]] |
[[Ranking_methods|Ranking&nbsp;methods]] |
[https://rosettacode.org/wiki/Remove_duplicate_elements Remove&nbsp;duplicate&nbsp;elements] |
[[Sorting algorithms/Sleep sort|Sleep&nbsp;sort]] |
[[Sorting algorithms/Sleep sort|Sleep&nbsp;sort]] |
[[Sorting algorithms/Stooge sort|Stooge&nbsp;sort]] |
[[Sorting algorithms/Stooge sort|Stooge&nbsp;sort]] |
[[https://rosettacode.org/wiki/Sort_the_letters_of_string_in_alphabitical_order Sort&nbsp;letters&nbsp;of&nbsp;a&nbsp;string]] |
[https://rosettacode.org/wiki/Sort_three_variables Three&nbsp;variable&nbsp;sort] |
[https://rosettacode.org/wiki/Sort_three_variables Three&nbsp;variable&nbsp;sort] |
[https://rosettacode.org/wiki/Topological_sort Topological&nbsp;sort] |
[https://rosettacode.org/wiki/Topological_sort Topological&nbsp;sort] |

Latest revision as of 23:31, 17 August 2021

Sorting Algorithm
This is a sorting algorithm.   It may be applied to a set of data in order to sort it.     For comparing various sorts, see compare sorts.   For other sorting algorithms,   see 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 | Common sorted list | Composite structures sort | Custom comparator sort | Counting sort | Disjoint sublist sort | External sort | Jort sort | Lexicographical sort | Natural sorting | Order by pair comparisons | Order disjoint list items | Order two numerical lists | Object identifier (OID) sort | Pancake sort | Quickselect | Permutation sort | Radix sort | Ranking methods | Remove duplicate elements | Sleep sort | Stooge sort | [Sort letters of a string] | 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=11474"