Sort algorithms home |
Java | C | FORTRAN | PASCAL
sort simple sort In-place sort quicksort balanced quicksort introspective sort insertion sort selection sort diminishing increment sort shell sort heapsort adaptive heap sort introspective sort adaptive sort adaptive heap sort distribution sort bin sort range sort counting sort histogram sort merge sort |
bin sort [linear insertion sort]
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: | http://ciips.ee.uwa.edu.au/%7Emorris/Year2/PLDS210/binsort.html [C] http://www.dcc.uchile.cl/%7Erbaeza/handbook/algs/4/423.sort.c [C]
See also bin sort variants: range sort, counting sort, histogram sort