Template:Sorting Algorithm: Difference between revisions

From Rosetta Code
Content added Content deleted
m (split a header text.)
m (put a category name on one line instead of splitting it.)
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. &nbsp; It may be applied to a set of data in order to sort it.


For other sorting algorithms, see [[:Category:Sorting Algorithms]], or:<br>
For other sorting algorithms, see [[:Category:Sorting Algorithms|Category:sorting&nbsp;algorithms]], or:<br>
<small><center><b>[[O]](''n'' log''n'') Sorts</b><br>
<small><center><b>[[O]](''n'' log''n'') Sorts</b><br>
[[Sorting algorithms/Heapsort|Heapsort]] |
[[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:

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 | 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


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