Analysis of Modified Heap Sort Algorithm on Different Environment
暂无分享,去创建一个
Vandana Sharma | Satwinder Singh | Parvinder S. Sandhu | Baljit Saini | Satwinder Singh | P. Sandhu | B. Saini | Vandana Sharma
[1] Mark Allen Weiss,et al. Best case lower bounds for Heapsort , 2005, Computing.
[2] Svante Carlsson. A Variant of Heapsort with Almost Optimal Number of Comparisons , 1987, Inf. Process. Lett..
[3] Klaus Reinhardt. Sorting In-Place with a Worst Case Complexity of n log n-1.3n + O(logn) Comparisons and epsilon n log n + O(1) Transports , 1992, ISAAC.
[4] Bruce A. Reed,et al. Building Heaps Fast , 1989, J. Algorithms.
[5] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, SIAM J. Comput..
[6] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[7] Bruce A. Reed,et al. Heap Building Bounds , 2005, WADS.
[8] Domenico Cantone,et al. QuickHeapsort, an efficient mix of classical sorting algorithms , 2000, Theor. Comput. Sci..
[9] Ronald D. Dutton,et al. Weak-heap sort , 1993, BIT.
[10] Svante Carlsson,et al. The complexity of heaps , 1992, SODA '92.
[11] Stefan Edelkamp,et al. Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons , 2002, JEAL.
[12] C. Q. Lee,et al. The Computer Journal , 1958, Nature.
[13] Ying-Jie Wu,et al. An Improved HEAPSORT Algorithm with nlogn − 0.788928n Comparisons in the Worst Case , 2007, Journal of Computer Science and Technology.
[14] Ingo Wegener. The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n , 1991, STACS.