Histogram sort
From Wikipedia, the free encyclopedia
An efficient 3-pass refinement of a bucket sort algorithm. The first pass counts the number of items for each bucket in an auxiliary array, and then makes a running total so each auxiliary entry is the number of preceding items. The second pass puts each item in its proper bucket according to the auxiliary entry for the key of that item. The last pass sorts each bucket.
Also known as interpolation sort.
[edit] See also
Paul E. Black, Histogram sort at the NIST Dictionary of Algorithms and Data Structures.
