原书出处
Introduction to Algorithms, Fourth Edition
7 第7章 快速排序
ere right down the middle. Indeed, even a 99-to-1 split yields an O(n lg n) running time.
In fact, any split of constant proportionality yields a recursion tree of depth Θ(lg n), where the cost at each level is O(n).
The running time is therefore O(n lg n) whenever the split has constant proportionality.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter007.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea