← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

7 第7章 快速排序

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

As we’ll see now, that could be as bad as Θ(n) in the worst case. Worst-case partitioning

The worst-case behavior for quicksort occurs when the partitioning produces one subproblem with n – 1 elements and one with 0 elements.

(See Section 7.4.1.) Let us assume that this unbalanced partitioning arises in each recur

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea