arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.05008math.COcs.DS
收藏

关于比较最优双枢轴快速选择的扩展注记

An Extended Note on the Comparison-optimal Dual Pivot Quickselect

Daniel Krenn

摘要:

在本说明中,确定了任何双枢轴快速选择算法(无采样)平均所需的精确最小键比较次数。其结果以比较最优算法的精确公式和渐近公式的形式给出。事实证明,这些渐近展开的主要条款与经典快速选择的相应分析的主要条款相一致,但仍然--正如雅罗斯拉夫斯基快速选择所示--在双枢轴变体中需要更多的比较。结果是通过求解二阶微分方程的生成函数从递归方法获得的。

英文摘要:

In this note the precise minimum number of key comparisons any dual-pivot quickselect algorithm (without sampling) needs on average is determined. The result is in the form of exact as well as asymptotic formulæ of this number of a comparison-optimal algorithm. It turns out that the main terms of these asymptotic expansions coincide with the main terms of the corresponding analysis of the classical quickselect, but still---as this was shown for Yaroslavskiy quickselect---more comparisons are needed in the dual-pivot variant. The results are obtained by solving a second order differential equation for the generating function obtained from a recursive approach.

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

↑