Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference16 articles.
1. [Ca87a] Carlsson, S.: Average-case results on heapsort. BIT27, 2 (1987).
2. [Ca87b] Carlsson, S.: A variant of heapsort with almost optimal number of comparisons. Information Processing Letters24, 4 (1987).
3. [Ca91] Carlsson, S.: An optimal algorithm for deleting the root of a heap. Information Processing Letters37, 2 (1991).
4. [Do84] Doberkat, E.: An average case analysis of Floyd's algorithm to construct heaps. Information and Control61, 2 (1984).
5. [DW91] Ding, Y., Weiss, M.: On heapsort algorithms that are good in both worst-case and averagecase, Tech. Report, School of Computer Science, Florida International University, Feb. 1991.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Homogeneous and Non-homogeneous Algorithms;Optimization Theory, Decision Making, and Operations Research Applications;2012-09-19
2. A New Variant of In-Place Sort Algorithm;Procedia Engineering;2012
3. An Improved HEAPSORT Algorithm with nlogn − 0.788928n Comparisons in the Worst Case;Journal of Computer Science and Technology;2007-11