|Sort algorithms home||
[linear insertion sort]
Also defined at: http://www.nist.gov/dads/HTML/bucketsort.html.
Inherits from distribution sort
A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key. Each bucket is sorted if necessary, and the buckets' contents are concatenated. [National Institute of Standards and Technology]
Implementations and sample code:
See also bin sort variants: range sort, counting sort, histogram sort