Running time of the treapsort algorithm

DOI10.1016/j.tcs.2013.03.012zbMath1293.68316OpenAlexW1977694409MaRDI QIDQ387004

D. Early, Michel Schellekens

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.012

zbMATH Keywords

\(\mathcal{MOQA}\)average-case analysis of algorithmssmoothed complexitysorting algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Entropy conservation for comparison-based algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
• Some properties of a limiting distribution in Quicksort
• Smoothed analysis of algorithms
• A limiting distribution for quicksort
• Smoothed analysis of algorithms
• Mathematical Foundations of Computer Science 2003

This page was built for publication: Running time of the treapsort algorithm