Non-Comparison Sorting

A sorting algorithm is an algorithm that puts elements of a list in a certain order, not using comparisons between elements (so elements are typically integers or real numbers).

Parameters

$n$ : size of list

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 11 of 11 algorithms


Burst Sort	2004	$O(wn)$	$O(wn)$
Thorup's Sorting Algorithm	2002	$O(n \log \log n)$	$O(n)$
Bead Sort	2002	$O(n)$	$O(n^2)$
Spreadsort	2002	$O(n \log n)$	$O(n)$
Flash Sort	1998	$O(n^2)$	$O(n)$
Signature Sort	1998	O(n log log n)	O(n)
Sorting with Fusion Trees	1990	O((n log n)/(log log n))	O(n)
Counting Sort	1954	$O(n+k)$	$O(n+k)$
Bucket Sort	1940	$O(n^2)$	$O(n)$
Radix Sort	1940	$O(wn)$	$O(w+n)$
Insertion Sort	1940	$O(n^2)$	$O(1)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms