We present a practically efficient algorithm for the internal sorting problem. Our algorithm works in-place and, on the average, has a running-time of O(n log n) in the length n of the input. More specifically, the algorithm performs n log n + 3n comparisons and n log n + 2.65n element moves on the average. An experimental comparison of our proposed algorithm with the most efficient variants of Quicksort and Heapsort is carried out and its results are discussed.
CITATION STYLE
Cantone, D., & Cincotti, G. (2000). QuickHeapsort, an efficient mix of classical sorting algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1767, 150–162. https://doi.org/10.1007/3-540-46521-9_13
Mendeley helps you to discover research relevant for your work.