arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.3600cs.DSmath.CO
收藏

小组选择算法

Selection Algorithms with Small Groups

Ke Chen, Adrian Dumitrescu

摘要:

我们重新讨论选择问题,即计算给定元素的$n$的$i$阶统计量,特别是Blum、Floyd、Pratt、Rivest和Tarjan(1973)提出的通过分组和划分的经典确定性算法。尽管原始算法使用至少$5$的奇数大小的组并在线性时间内运行,但在文献中一直存在使用较小的组大小将迫使最坏情况下的运行时间变为超线性,即$Ω(n \log{n})$。我们首先指出,通常的参数在文献中发现证明超线性最坏情况下的运行时间不足以证明这一说法。我们进一步证明,它是可以使用组大小小于$5$,同时保持最坏情况下的线性运行时间。为此,我们介绍了三个简单的变种的经典算法,重复的步骤算法,移动目标算法,和超对算法,所有运行在线性时间。

英文摘要:

We revisit the selection problem, namely that of computing the $i$th order statistic of $n$ given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973). Whereas the original algorithm uses groups of odd size at least $5$ and runs in linear time, it has been perpetuated in the literature that using smaller group sizes will force the worst-case running time to become superlinear, namely $Ω(n \log{n})$. We first point out that the usual arguments found in the literature justifying the superlinear worst-case running time fall short of proving this claim. We further prove that it is possible to use group size smaller than $5$ while maintaining the worst case linear running time. To this end we introduce three simple variants of the classic algorithm, the repeated step algorithm, the shifting target algorithm, and the hyperpair algorithm, all running in linear time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑