论文信息 - BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small)

BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small)

Abstract A variant of HEAPSORT, called BOTTOM-UP-HEAPSORT, is presented. It is based on a new reheap procedure. This sequential sorting algorithm is easy to implement and beats, on an average, QUICKSORT if n⩾400 and a clever version of QUICKSORT (where the split object is the median of 3 randomly chosen objects) if n⩾16000. The worst-case number of comparisons is bounded by 1.5n log n+O(n). Moreover, the new reheap procedure improves the delete procedure for the heap data structure for all n.

Ingo Wegener

[1] Svante Carlsson. A Variant of Heapsort with Almost Optimal Number of Comparisons , 1987, Inf. Process. Lett..

[2] Rudolf Fleischer. A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort , 1991, ISA.

[3] Ernst-Erich Doberkat,et al. An Average Case Analysis of Floyd's Algorithm to Construct Heaps , 1984, Inf. Control..

[4] M. H. van Emden. Increasing the efficiency of quicksort , 1970, CACM.

[5] Christos Levcopoulos. An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation , 1987, Inf. Process. Lett..

[6] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[7] Gu Xunrang,et al. A New HEAPSORT Algorithm and the Analysis of Its Complexity , 1990, Comput. J..

[8] Svante Carlsson,et al. Average-case results on heapsort , 1987, BIT.

[9] 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.

[10] Bruce A. Reed,et al. Building Heaps Fast , 1989, J. Algorithms.