Author:
Wang Xiao-Dong,Wu Ying-Jie
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference16 articles.
1. Knuth D E. The Art of Computer Programming — Sorting and Searching. 2nd Edition, New York: Addison Wesley, 1998.
2. Floyd R W. Algorithm 245: Treesort 3. Communications of the ACM, 1964, 7(4): 701.
3. Williams J W J. Algorithm 232: HEAPSORT. Communications of the ACM, 1964, 7(4): 347–348.
4. Wegener I. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT, beating on an average, QUICKSORT (if n is not very small). Theoretical Computer Science, 1993, 118(1): 81–98.
5. Carlsson S. A variant of HEAPSORT with almost optimal number of comparisons. Information Processing Letters, 1987, 24(3): 247–250.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. QuickHeapsort: Modifications and Improved Analysis;Theory of Computing Systems;2015-09-15
2. QuickHeapsort: Modifications and Improved Analysis;Computer Science – Theory and Applications;2013
3. Homogeneous and Non-homogeneous Algorithms;Optimization Theory, Decision Making, and Operations Research Applications;2012-09-19
4. An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons;International Journal of Computer Mathematics;2011-11
5. AI-VCR Addition Computing without Overflowing;Quantitative Logic and Soft Computing 2010;2010