Bottom-up mergesort -- A detailed analysis

DOI10.1007/BF01294131zbMath0833.68038OpenAlexW2066690787MaRDI QIDQ1899222

Prodinger, Helmut, Wolfgang Panny

Publication date: 9 October 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01294131

zbMATH Keywords

mergesort algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (5)

Unnamed Item ⋮ EuMMD: efficiently computing the MMD two-sample test statistic for univariate data ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ QuickXsort: a fast sorting scheme in theory and practice

Cites Work

• Unnamed Item
• Unnamed Item
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Queue-mergesort
• Mellin transforms and asymptotics: Digital sums
• Mellin transforms and asymptotics. The mergesort recurrence
• Estimates for a remainder term associated with the sum of digits function

This page was built for publication: Bottom-up mergesort -- A detailed analysis