Template:Sorting Algorithm: Difference between revisions
m (split a header text.) |
m (added: for seeing other sorts ...) |
||
(26 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. It may be applied to a set of data in order to sort it. |
This is a sorting algorithm. It may be applied to a set of data in order to sort it. |
||
For comparing various sorts, see [https://rosettacode.org/wiki/Compare_sorting_algorithms%27_performance compare sorts]. |
|||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
[[Sorting algorithms/Bubble sort|Bubble sort]] | |
[[Sorting algorithms/Bubble sort|Bubble sort]] | |
||
[[Sorting algorithms/Cocktail sort|Cocktail sort]] | |
[[Sorting algorithms/Cocktail sort|Cocktail sort]] | |
||
[[Sorting algorithms/Cocktail sort with shifting bounds|Cocktail sort with shifting bounds]] | |
[[Sorting algorithms/Cocktail sort with shifting bounds|Cocktail sort with shifting bounds]] | |
||
[[Sorting algorithms/Comb sort|Comb sort]] | |
[[Sorting algorithms/Comb sort|Comb sort]] | |
||
[[Sorting algorithms/Cycle sort|Cycle sort]] | |
|||
[[Sorting algorithms/Gnome sort|Gnome sort]] | |
[[Sorting algorithms/Gnome sort|Gnome sort]] | |
||
[[Sorting algorithms/Insertion sort|Insertion sort]] | |
[[Sorting algorithms/Insertion sort|Insertion sort]] | |
||
[[Sorting algorithms/Selection sort|Selection sort]] | |
[[Sorting algorithms/Selection sort|Selection sort]] | |
||
[[Sorting algorithms/Strand sort|Strand sort]] |
[[Sorting algorithms/Strand sort|Strand sort]] |
||
<b>other sorts</b><br> |
|||
[[Sorting algorithms/Bead sort|Bead sort]] | |
[[Sorting algorithms/Bead sort|Bead sort]] | |
||
[[Sorting algorithms/Bogosort| |
[[Sorting algorithms/Bogosort|Bogo sort]] | |
||
[https://rosettacode.org/wiki/Common_sorted_list Common sorted list] | |
|||
[https://rosettacode.org/wiki/Sort_an_array_of_composite_structures Composite structures sort] | |
|||
[https://rosettacode.org/wiki/Sort_using_a_custom_comparator Custom comparator 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/JortSort Jort sort] | |
|||
[https://rosettacode.org/wiki/Sort_numbers_lexicographically Lexicographical sort] | |
|||
[https://rosettacode.org/wiki/Natural_sorting Natural sorting] | |
|||
[https://rosettacode.org/wiki/Order_by_pair_comparisons Order by pair comparisons] | |
|||
[https://rosettacode.org/wiki/Order_disjoint_list_items Order disjoint list items] | |
|||
[https://rosettacode.org/wiki/Order_two_numerical_lists Order two numerical lists] | |
|||
[https://rosettacode.org/wiki/Sort_a_list_of_object_identifiers Object identifier (OID) sort] | |
|||
[[Sorting algorithms/Pancake sort|Pancake sort]] | |
|||
[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]] | |
||
[[Ranking_methods|Ranking methods]] | |
|||
[https://rosettacode.org/wiki/Remove_duplicate_elements Remove duplicate elements] | |
|||
[[Sorting algorithms/Sleep sort|Sleep sort]] | |
[[Sorting algorithms/Sleep sort|Sleep sort]] | |
||
[[Sorting algorithms/Stooge sort|Stooge sort]] |
[[Sorting algorithms/Stooge sort|Stooge sort]] | |
||
[[https://rosettacode.org/wiki/Sort_the_letters_of_string_in_alphabitical_order Sort letters of a string]] | |
|||
[https://rosettacode.org/wiki/Sort_three_variables Three variable sort] | |
|||
[https://rosettacode.org/wiki/Topological_sort Topological sort] | |
|||
[[Sorting algorithms/Tree sort on a linked list|Tree sort]] |
|||
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude> |
</center></small></div><includeonly>[[Category:Sorting Algorithms]]</includeonly><noinclude>{{template}}</noinclude> |
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:
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