arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.04784cs.DS
收藏

原位置换算法主要代价的收敛速度

Rate of convergence of major cost incurred in the in-situ permutation algorithm

Sumit Kumar Jha

摘要:

MacLeod提出的原位置换算法用$(x_{p(1)},\cdots,x_{p(n)})$替换$(x_{1},\cdots,x_{n})$,其中$π=(p(1),\cdots,p(n))$是至多使用$O(1)$空间的$\{1,2,\cdots,n\}$的置换。Kirshenhofer、Killinger和Tichy已经证明,算法中产生的主要成本满足类似于快速排序算法对$n$随机排列项的数组进行排序所需的键比较数的序列的递归。此外,Hwang证明了归一化成本在分布中收敛。在这里,根据Neininger和Rüschendorf,我们证明了该收敛速度是在Zolotarev度量的顺序$Θ(\ln(n)/n)$。

英文摘要:

The in-situ permutation algorithm due to MacLeod replaces $(x_{1},\cdots,x_{n})$ by $(x_{p(1)},\cdots,x_{p(n)})$ where $π=(p(1),\cdots,p(n))$ is a permutation of $\{1,2,\cdots,n\}$ using at most $O(1)$ space. Kirshenhofer, Prodinger and Tichy have shown that the major cost incurred in the algorithm satisfies a recurrence similar to sequence of the number of key comparisons needed by the Quicksort algorithm to sort an array of $n$ randomly permuted items. Further, Hwang has proved that the normalized cost converges in distribution. Here, following Neininger and Rüschendorf, we prove the that rate of convergence to be of the order $Θ(\ln(n)/n)$ in the Zolotarev metric.

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

↑