原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
n distinct elements z1 < z2 < ⋯ < zn. Given two arbitrary elements zi and zj where i < j,
the probability that they are compared is 2/(j – i + 1).
Proof Let’s look at the tree of recursive calls that RANDOMIZED-QUICKSORT makes, and cons
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea