QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | QuickHeapsort, an efficient mix of classical sorting algorithms |
scientific article |
Statements
QuickHeapsort, an efficient mix of classical sorting algorithms (English)
0 references
5 August 2002
0 references
We present an efficient and practical 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 size \(n\) of the input. More specifically, the algorithm performs \(n\log n+2.996n+o(n)\) comparisons and \(n\log n+2.645n+o(n)\) 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.
0 references
in-place sorting
0 references
heapsort
0 references
quicksort
0 references
analysis of algorithms
0 references
0 references