QuickXsort: a fast sorting scheme in theory and practice
From MaRDI portal
Publication:2292860
DOI10.1007/s00453-019-00634-0zbMath1447.68003arXiv1811.01259OpenAlexW2981906129WikidataQ127025748 ScholiaQ127025748MaRDI QIDQ2292860
Armin Weiß, Stefan Edelkamp, Sebastian Wild
Publication date: 6 February 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.01259
Related Items (3)
On the upper bound of the complexity of sorting ⋮ On the average case of MergeInsertion ⋮ QuickXsort: a fast sorting scheme in theory and practice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QuickHeapsort: modifications and improved analysis
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
- Asymptotic expansions of the mergesort recurrences
- The analysis of Quicksort programs
- Queue-mergesort
- Weak-heap sort
- Mellin transforms and asymptotics. The mergesort recurrence
- Time bounds for selection
- QuickHeapsort, an efficient mix of classical sorting algorithms
- Bottom-up mergesort -- A detailed analysis
- QuickXsort: a fast sorting scheme in theory and practice
- Optimal Sampling Strategies in Quicksort and Quickselect
- Basic Real Analysis
- Ratio Based Stable In-Place Merging
- Improved master theorems for divide-and-conquer recurrences
- An average case analysis of Floyd's algorithm to construct heaps
- Heaps on Heaps
- Combinatorial analysis of quicksort algorithm
- An improved master theorem for divide-and-conquer recurrences
- BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
- Building heaps fast
- QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average
- Quicksort Is Optimal For Many Equal Keys
- Worst-Case Efficient Sorting with QuickMergesort
- Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons
- A Tournament Problem
- Asymptotically efficient in-place merging
- Improved average complexity for comparison-based sorting
- On the average case of MergeInsertion
This page was built for publication: QuickXsort: a fast sorting scheme in theory and practice
