Worst-Case Efficient Sorting with QuickMergesort

DOI10.1137/1.9781611975499.1zbMath1430.68065arXiv1811.00833OpenAlexW2964158208MaRDI QIDQ5232746

Armin Weiß, Stefan Edelkamp

Publication date: 13 September 2019

Published in: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

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 ⋮ Finding a mediocre player ⋮ MoMQuickMergesort

Uses Software

• QuickHeapsort
• Grailsort
• WikiSort
• pdqsort

This page was built for publication: Worst-Case Efficient Sorting with QuickMergesort