QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average

DOI10.1007/978-3-319-06686-8_11zbMath1407.68119arXiv1307.3033OpenAlexW1815168186MaRDI QIDQ4981155

Armin Weiß, Stefan Edelkamp

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmsquicksortin-place sortingmergesort

Mathematics Subject Classification ID

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

Related Items (5)

Unnamed Item ⋮ Small Complexity Gaps for Comparison-Based Sorting ⋮ On the average case of MergeInsertion ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Improved average complexity for comparison-based sorting

This page was built for publication: QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average