← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

8 第8章 线性时间排序

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.683Z

es than quicksort over the n keys, each pass of radix sort may take significantly longer.

Which sorting algorithm to prefer depends on the characteristics of the implementations, of the underlying machine

(e.g., quicksort often uses hardware caches more effectively than radix sort), and of the

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter008.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea