QuickHeapsort: modifications and improved analysis

DOI10.1007/s00224-015-9656-yzbMath1353.68063arXiv1209.4214OpenAlexW1925220756MaRDI QIDQ504991

Volker Diekert, Armin Weiß

Publication date: 18 January 2017

Published in: Theory of Computing Systems, Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4214

zbMATH Keywords

analysis of algorithmsquicksortQuicksortHeapsortin-place sortingheapsort

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (4)

Unnamed Item ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ QuickHeapsort ⋮ Complexity analysis and performance of double hashing sort algorithm

Uses Software

• QuickHeapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• Weak-heap sort
• Time bounds for selection
• QuickHeapsort, an efficient mix of classical sorting algorithms
• Optimal Sampling Strategies in Quicksort and Quickselect
• In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
• Heaps on Heaps
• Building heaps fast
• Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons

This page was built for publication: QuickHeapsort: modifications and improved analysis