原书出处
Introduction to Algorithms, Fourth Edition
9 第9章 中位数和顺序统计量
s helpful. ▪ We can now bound the expected running time of RANDOMIZED-SELECT. Theorem 9.2
The procedure RANDOMIZED-SELECT on an input array of n distinct elements has an expected running time of Θ(n).
Proof Since not every partitioning is necessarily helpful, let’s give each partitioning a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea