counting sort
Google
Sort algorithms home
JavaCFORTRANPASCAL
sort counting sort

Also defined at: http://www.nist.gov/dads/HTML/countingsort.html.

Inherits from bin sort

A 2-pass sort algorithm which is efficient when the range of keys is small and there many duplicate keys. The first pass counts the occurrences of each key in an auxiliary array, and then makes a running total so each auxiliary entry is the number of preceding keys. The second pass puts each item in its final place according to the auxiliary entry for that key. [National Institute of Standards and Technology]

Author: Nikita Ogievetsky, © Cogitech, Inc. 2002