comparison counting sort

views updated

comparison counting sort A sorting algorithm that stores, for each sortkey, the number of keys less than the given key. If Nj denotes the number of keys less than the jth key then (assuming that keys are unique) the jth record should be in position Nj + 1 in a file sorted into ascending order of the keys. This is a simple but inefficient algorithm.

About this article

comparison counting sort

Updated About encyclopedia.com content Print Article