A variant of Heapsort with almost optimal number of comparisons
Information Processing Letters
Simplified stable merging tasks
Journal of Algorithms
Communications of the ACM
The Computer Journal - Special issue on models and architectures
Sorting in-place with minimum data movement
Sorting in-place with minimum data movement
Journal of Algorithms
Sorting with minimum data movement
Journal of Algorithms
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
An in-place sorting with O(nlog n) comparisons and O(n) moves
Journal of the ACM (JACM)
A simple algorithm for in-place merging
Information Processing Letters
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
An experimental study of sorting and branch prediction
Journal of Experimental Algorithmics (JEA)
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Configuration Merging in Point-to-Point Networks for Module-Based FPGA Reconfiguration
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
A simple algorithm for in-place merging
Information Processing Letters
Theoretical Computer Science
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Branch mispredictions don't affect mergesort
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Accelerating simulation of agent-based models on heterogeneous architectures
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
| Hi-index | 0.00 |
Two in-place variants of the classical mergesort algorithm are analysed in detail. The first, straightforward variant performs at most N log2 N + O(N) comparisons and 3N log2 N + O(N) moves to sort N elements. The second, more advanced variant requires at most N log2 N + O(N) comparisons and εN log2 N moves, for any fixed ε 0 and any N N(ε). In theory, the second one is superior to advanced versions of heapsort. In practice, due to the overhead in the index manipulation, our fastest in-place mergesort behaves still about 50 per cent slower than the bottom-up heapsort. However, our implementations are practical compared to mergesort algorithms based on in-place merging.