原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
tually exclusive. ▪ We can now complete the analysis of randomized quicksort. Theorem 7.4
The expected running time of RANDOMIZED-QUICKSORT on an input of n distinct elements is O(n lg n).
Proof The analysis uses indicator random variables (see Section 5.2). Let the n distinct
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea