by

Wikipedia Bot (@wikibot, 0)

Sorting algorithms

Table of contents

Comparison sorts

Stable sorts

Adaptive heap sort

Adaptive sort

Batcher odd–even mergesort

Bead sort

Bitonic sorter

Block sort

Bogosort

Bubble sort

Bucket sort

Cartesian tree

Cascade merge sort

Cocktail shaker sort

Comb sort

Comparison sort

Counting sort

Cubesort

Cycle sort

Dutch national flag problem

Elevator algorithm

Flashsort

Gnome sort

Heapsort

Insertion sort

Integer sorting

Internal sort

Interpolation sort

Inversion (discrete mathematics)

K-sorted sequence

K-way merge algorithm

Kaprekar's routine

Kirkpatrick–Reisch sort

Library sort

Median cut

Merge-insertion sort

Merge algorithm

Odd–even sort

Oscillating merge sort

Pairwise sorting network

Pancake sorting

Partial sorting

Patience sorting

Pigeonhole sort

Polyphase merge sort

Proportion extend sort

Proxmap sort

Qsort

Radix sort

Run of a sequence

Schwartzian transform

Selection sort

Shellsort

Slowsort

Smoothsort

Sort (C++)

Sort (Unix)

Sorting

Sorting algorithm

Sorting network

Spaghetti sort

Splaysort

Spreadsort

Stooge sort

Strand sort

Stupid sort

Timsort

Tournament sort

Tree sort

Weak heap

X + Y sorting

 Ancestors (5)

View article source

Discussion (0)

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.

See all articles in the same topic Create my own version