原书出处
Introduction to Algorithms, Fourth Edition
9 第9章 中位数和顺序统计量
upper bound, we do not know whether the groups-of-3 strategy actually runs in O(n) time.
But by repeating the groups-of-3 idea on the middle group of medians, we can pick a pivot that guarantees O(n) time.
The SELECT3 algorithm on the next page determines the ith smallest of an input array of n
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea