原书出处
Introduction to Algorithms, Fourth Edition
9 第9章 中位数和顺序统计量
Θ(n) + Θ(n) + Θ(1) = Θ(n). Now let’s determine the running time for the recursive calls.
The recursive call to find the pivot in line 16 takes T (g) ≤ T (n/5) time, since g ≤ n/5 and T (n) monotonically increases.
Of the two recursive calls in lines 23 and 24, at most one is executed. But we’ll see tha
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea