(algorithm)
Definition: A sort algorithm which uses knowledge of the domain of the items to calculate the position of each item in the sorted array.
See also radix sort, bucket sort, distribution sort, restricted universe sort.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:00 2006.
Cite this as:
Sandeep Kumar Shukla, "address-calculation sort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/addresscalc.html
