Least-significant-digit radix sort
Represent nonnegative integer keys with d base-B digits and stably sort each digit from least to most significant.
Key knowledge
Represent nonnegative integer keys with d base-B digits and stably sort each digit from least to most significant. After each pass the processed suffix is ordered, giving total O(d(n+B)) time with counting-sort passes. Choosing B=n makes bounded nᶜ keys linear-time for fixed c.
Conditions and scope
- n≥2, B≥2; digit extraction and indexing have unit cost in the stated word model.
- Stability of every digit pass is required; unbounded bit lengths increase d and the actual bit cost.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture5 Tuple Sort and Radix Sort, printed3–4; general-base cost by the same counted bucket passes.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-lsd-radix-sort
- Revision
- university-core.1
- Structured reference record
- University core expansion