三分割随机选择
Randomized selection with tripartitioning
摘要：
我们表明，几个版本的Floyd和Rivest的算法选择[通信。ACM { \bf 18}（1975）173]用于找到$k$第最小的$n$元素平均需要至多$n+\min\{k,n-k\}+o(n)$比较，即使当出现相等的元素时。这与我们最近对弗洛伊德和里维斯特提出的另一种变体的分析相类似[ACM通讯{ \bf 18}（1975）165- 172]。我们的计算结果表明，这两种变体在实践中表现良好，并可能与其他选择方法，如霍尔的查找或快速选择与中位数3枢轴。
英文摘要：
We show that several versions of Floyd and Rivest's algorithm Select [Comm.\ ACM {\bf 18} (1975) 173] for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+o(n)$ comparisons on average, even when equal elements occur. This parallels our recent analysis of another variant due to Floyd and Rivest [Comm. ACM {\bf 18} (1975) 165--172]. Our computational results suggest that both variants perform well in practice, and may compete with other selection methods, such as Hoare's Find or quickselect with median-of-3 pivots.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
