原书出处
Introduction to Algorithms, Fourth Edition
8 第8章 线性时间排序
More generally, we have some flexibility in how to break each key into digits. Lemma 8.4
Given n b-bit numbers and any positive integer r ≤ b, RADIX-SORT correctly sorts these numbers in Θ((b/r)(n + 2r)) time
if the stable sort it uses takes Θ(n + k) time for inputs in the range 0 to k. Proof For
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter008.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea