重新审视分区排序:重新确认平均情况下的鲁棒性等等!
Partition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
摘要:
在我们之前的工作中,有一些迹象表明分区排序可能比流行的快速排序具有更强大的平均情况O(nlogn)复杂度。在本文的第一项研究中,我们通过计算机实验重新确认了这一点,从柯西分布的期望理论上不存在的输入。此外,该算法被发现是敏感的输入概率分布的参数,需要进一步研究参数化的复杂性。在我们的第二项研究中,该算法对二项式输入的结果在这个方向上非常令人鼓舞。
英文摘要:
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick Sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of the input probability distribution demanding further investigation on parameterized complexity. The results on this algorithm for Binomial inputs in our second study are very encouraging in that direction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。