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

与QuickSort密钥比较极限的精确L^2距离(扩展摘要)

Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)

Patrick Bindjeme, James Allen Fill

摘要:

使用递归方法,我们得到了一个简单的精确表达式的L^2-距离的限制在Régnier(1989)的经典极限定理的关键比较所需的数量快速排序。Fill和Janson(2002)使用类似的方法进行的先前研究发现d_2-距离的数量级在n^{-1} log n和n^{-1/2}之间,Neininger和Ruschendorf(2002)的另一项研究发现Zolotarev zeta_3-距离的数量级为n^{-1} log n。我们的表达式揭示了L^2-距离渐近等价于(2 n^{-1} ln n)^{1/2}。

英文摘要:

Using a recursive approach, we obtain a simple exact expression for the L^2-distance from the limit in Régnier's (1989) classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson (2002) using a similar approach found that the d_2-distance is of order between n^{-1} log n and n^{-1/2}, and another by Neininger and Ruschendorf (2002) found that the Zolotarev zeta_3-distance is of exact order n^{-1} log n. Our expression reveals that the L^2-distance is asymptotically equivalent to (2 n^{-1} ln n)^{1/2}.

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

↑