原书出处
Introduction to Algorithms, Fourth Edition
9 第9章 中位数和顺序统计量
otal length of the spurs? Show how to determine an optimal location in linear time. 9.3-8
The kth quantiles of an n-element set are the k – 1 order statistics that divide the sorted set into k equal-sized sets (to within 1).
Give an O(n lg k)-time algorithm to list the kth quantiles of a set. 9.3-9 Describe an O(
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea