Overview

radix sorting


Show Summary Details

Quick Reference

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.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.