Asymptotic distributions for random median quicksort

DOI10.1016/j.jda.2006.07.003zbMath1128.68029OpenAlexW1964774166MaRDI QIDQ2466023

Hassan M. Okasha, Uwe Roesler

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.07.003

zbMATH Keywords

contraction methodanalysis of algorithmquicksortsorting algorithmEuler differential equationdivide-and-conquer algorithmrecursive equationstochastic fixed point equation

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Analysis of algorithms (68W40) Searching and sorting (68P10)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some asymptotic theory for the bootstrap
• A fixed point theorem for distributions
• The analysis of Quicksort programs
• The contraction method for recursive algorithms
• On the analysis of stochastic divide and conquer algorithms
• Increasing the efficiency of quicksort
• A limit theorem for “quicksort”
• Quicksort

This page was built for publication: Asymptotic distributions for random median quicksort