原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
e number of times that array elements are compared, not comparisons of indices. Lemma 7.1
The running time of QUICKSORT on an n-element array is O(n + X), where X is the number of element comparisons performed.
Proof The running time of QUICKSORT is dominated by the time spent in the PARTITION proce
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea