← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

7 第7章 快速排序

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

// pivot goes just to the right of the low side 8 return i + 1 // new index of the pivot

At the beginning of each iteration of the loop of lines 3–6, for any array index k, the following conditions hold: if p ≤ k ≤ i, then A[k] ≤ x (the tan region of Figure 7.2); if i + 1 ≤ k ≤ j – 1, then A[k] > x (the blue region); if k = r, then A[k] = x (the yellow region).

We need to show that this loop invariant is true prior to the first iteration, that each

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea