radix sorting

views updated

radix sorting (digital sorting; pocket sorting) A sorting algorithm in which the file is first sorted on the least significant digit of the sortkey, then the next least significant until in the final pass a sort is made on the most significant digit. The algorithm is best implemented using linked lists. See also divide and conquer sorting.