← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

7 第7章 快速排序

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

ivot value (originally in A[p]) into one of the two partitions A[p : j] and A[j + 1 : r].

Since p ≤ j < r, neither partition is empty.

f. Rewrite the QUICKSORT procedure to use HOARE-PARTITION. 7-2 Quicksort with equal eleme

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea