scientific article; zbMATH DE number 7359768

DOI10.4230/LIPIcs.AofA.2018.36zbMath1478.68071arXiv1803.05948MaRDI QIDQ4993558

Sebastian Wild

Publication date: 15 June 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

average-case analysisconstant-factor optimal sortingin-situ sortingpivot samplingQuickHeapsortQuickMergesortQuicksort recurrence

Mathematics Subject Classification ID

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

Related Items (1)

QuickXsort: a fast sorting scheme in theory and practice

Uses Software

• QuickHeapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• QuickHeapsort: modifications and improved analysis
• Asymptotic expansions of the mergesort recurrences
• Mellin transforms and asymptotics. The mergesort recurrence
• QuickHeapsort, an efficient mix of classical sorting algorithms
• Bottom-up mergesort -- A detailed analysis
• Optimal Sampling Strategies in Quicksort and Quickselect
• In-Place Sorting
• Improved master theorems for divide-and-conquer recurrences
• An average case analysis of Floyd's algorithm to construct heaps
• QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average
• A Tournament Problem

This page was built for publication: