Affiliation:
1. Stanford Univ., Stanford, CA
Abstract
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the
i
th smallest of
n
numbers is
n
+ min(
i,n-i
) +
o
(
n
). A lower bound within 9 percent of the above formula is also derived.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Blum M. Flyod R. W. Pratt V. Rivest R. and Tarjan R. Time bounds for selection JCSS 7(Aug. 197.) 448-461 Blum M. Flyod R. W. Pratt V. Rivest R. and Tarjan R. Time bounds for selection JCSS 7(Aug. 197.) 448-461
2. Floyd Robert W. and Rivest Ronald W. Algorithm 489 The algorithm SELECT for finding the ith smallest of n elements. Comm ACM this issue. 10.1145/360680.360694 Floyd Robert W. and Rivest Ronald W. Algorithm 489 The algorithm SELECT for finding the ith smallest of n elements. Comm ACM this issue. 10.1145/360680.360694
3. Algorithm 63: partition
Cited by
168 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献