Show Summary Details
Quick Reference
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.
Subjects: Computing.
Related content in Oxford Index
Reference entries
Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.
