Abstract
With refinements to the WEAK-HEAPSORT algorithm we establish the general and practical relevant sequential sorting algorithm RELAXED-WEAK-HEAPSORT executing exactly n_log n_ 2_log n_ + 1 = n log n 0.9n comparisons on any given input. The number of transpositions is bounded by n plus the number of comparisons. Experiments show that RELAXED-WEAK-HEAPSORT only requires O(n) extra bits. Even if this space is not available, with QUICK-WEAK-HEAPSORT we propose an efficient QUICKSORT variant with n log n+0.2n+ o(n) comparisons on the average. Furthermore, we present data showing that WEAK-HEAPSORT, RELAXED-WEAK-HEAPSORT and QUICK-WEAK-HEAPSORT beat other performant QUICKSORT and HEAPSORT variants even for moderate values of n.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Bojesen, J. Katajainen, and M. Spork. Performance engineering case study: Heap construction. WAE, LNCS, pages 301–315, 1999.
D. Cantone and G. Cinotti. QuickHeapsort, an efficient mix of classical sorting algorithms. CIAC, LNCS, 1767:150–162, 2000.
E. E. Doberkat. An average case analysis of Floyd’s algorithm to construct heaps. Information and Control, 61(2):114–131, 1984.
R. D. Dutton. The weak-heap data structure. Technical report, University of Central Florida, Orlando, FL 32816, 1992.
R. D. Dutton. Weak-heap sort. BIT, 33:372–381, 1993.
S. Edelkamp and I. Wegener. On the performance of WEAK-HEAPSORT. STACS, LNCS, pages 254–266, 2000.
M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithm. Journal ofthe ACM, 34(3):596–615, 1987.
C. A. R. Hoare. Quicksort. Computer Journal, 5(1):10–15, 1962.
D. Knuth. The Art ofComputer Programming, Vol. III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Text and Monographs in Computer Science. Springer-Verlag, 1993.
C. J. H. McDiarmid and B. A. Reed. Building heaps fast. Journal of Algorithms, 10:352–365, 1989.
S. Nilsson. Radix Sorting & Searching. PhD thesis, Lund University, 1996.
A. Papernov and G. Stasevich. The worst case in shellsort and related algorithms. Problems Inform. Transmission, 1(3):63–75, 1965.
K. Reinhardt. Sorting in-place with a worst case complexity of n log n − 1.3n + O(log n) comparisons and εn log n + O(1) transports. LNCS, 650:489–499, 1992.
H. Steinhaus. One hundred problems in elemantary mathematics (Problems 52,85). Pergamon Press, London, 1958.
M. H. van Emden. Increasing the efficiency of QUICKSORT. Communications of the ACM, 13:563–567, 1970.
I. Wegener. The worst case complexity of McDiarmid and Reed’s variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n. Information and Computation, 97(1):86–96, 1992.
I. Wegener. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT, beating, on an average, QUICKSORT (if n is not very small). TCS, 118:81–98, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edelkamp, S., Stiegeler, P. (2001). Pushing the Limits in Sequential Sorting. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-44691-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42512-0
Online ISBN: 978-3-540-44691-0
eBook Packages: Springer Book Archive