原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
1, … , zj} by Zij. The next lemma characterizes when two elements are compared. Lemma 7.2
During the execution of RANDOMIZED-QUICKSORT on an array of n distinct elements z1 < z2 < ⋯ < zn, an element zi is compared with an element zj, where i < j, if and only if one of them is chosen as a pivot before any other element in the set Zij. Moreover, no two elements are ever compared twice.
Proof Let’s look at the first time that an element x ∈ Zij is chosen as a pivot during th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea