Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

Sumit Kumar Jha

首页> 外文期刊>Discrete mathematics, algorithms, and applications >Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

【24h】

Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

机译：重新检测随机快速排序算法使用的比较数矩的计算

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate the moments of number of comparisons used by the randomized quick sort algorithm. We reemphasize that this approach helps in calculating these quantities with less computation. We also point out that as observed by Knuth this method also gives moments for total path length of a binary search tree built over a random set of n keys.

机译：我们重新审视Kirschenhofer，Prodinger和Tichy的方法，计算随机快速排序算法使用的比较数量的时刻。我们重新调整了这种方法有助于计算这些数量，计算较少。我们还指出，由于Knuth观察到，此方法还为在随机集N键上构建的二进制搜索树的总路径长度提供了瞬间。

著录项

来源
《Discrete mathematics, algorithms, and applications》 |2017年第1期|共6页
作者
Sumit Kumar Jha;
展开▼
作者单位

Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500 032 India;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类应用数学;
关键词
Sorting; quick sort; analysis of algorithms;

机译：分类;快速排序;算法分析;

相似文献

外文文献
中文文献
专利

1. Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm [J] . Sumit Kumar Jha Discrete mathematics, algorithms, and applications . 2017,第1期

机译：重新检测随机快速排序算法使用的比较数矩的计算
2. Fault Tolerant Sorting—Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm [J] . K. Subramani, C. Tauras, David Owen Journal of Mathematical Modelling and Algorithms . 2008,第3期

机译：容错排序-随机QuickMergesort算法的理论和经验分析
3. Bayesian biclustering by dynamics: Algorithm testing, comparison against random agglomeration, and calculation of application specific prior information [J] . Helen Pinto, Ian Gates, Xin Wang MethodsX . 2020,第1期

机译：贝叶斯双板通过动态：算法测试，随机凝聚的比较，以及应用特定于应用程序的计算
4. Quicker Sort Algorithm: Upgrading time complexity of Quick Sort to Linear Logarithmic [C] . Sandeep Kumar Budhani, Naveen Tewari, Mukesh Joshi, International Conference on Computation, Automation and Knowledge Management . 2021

机译：更快地排序算法：升级快速排序的时间复杂度直线对数
5. Comparison of AAA and Acuros XB Dose Calculation Algorithms for SRS [D] . Yeh, Feng-Ju . 2020

机译：SRS的AAA和Acuros XB剂量计算算法的比较
6. Bayesian biclustering by dynamics: Algorithm testing comparison against random agglomeration and calculation of application specific prior information [O] . Helen Pinto, Ian Gates, Xin Wang 2020

机译：通过动力学进行的贝叶斯双聚类：算法测试与随机聚集的比较以及特定于应用程序的先验信息的计算
7. Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm [O] . Jha, Sumit Kumar 2016

机译：重新审视计算所使用的比较次数的矩随机快速排序算法

Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

摘要

著录项

相似文献

相关主题

期刊订阅