Apart from the median-of-medians algorithm, is there any other way to do k-selection in worst-case O(n) time? Does implementing median-of-medians make sense; I mean, is the performance advantage good enough for practical purposes ?Apart from the median-of-medians algorithm, is
阅读背景：
最坏情况O(n) k选择算法。
来源：互联网
分享到：
