The quicksort process

DOI10.1016/J.SPA.2013.09.014zbMath1306.60011arXiv1302.3770OpenAlexW2001408668MaRDI QIDQ2434753

M. Z. Ragab, Uwe Roesler

Publication date: 7 February 2014

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

weak convergencesortingstochastic processcadlag functionsrunning time analysisquicksort process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Searching and sorting (68P10) Special processes (60K99)

Related Items (4)

Almost sure convergence to the quicksort process ⋮ Process convergence for the complexity of radix selection on Markov sources ⋮ All solutions of the stochastic fixed point equation of the Quicksort process ⋮ The dual tree of a recursive triangulation of the disk

Uses Software

• Quicksort
• Find

Cites Work

• A fixed point theorem for distributions
• A characterization of the set of fixed points of the quicksort transformation
• The contraction method for recursive algorithms
• On a functional contraction method
• Optimal Sampling Strategies in Quicksort and Quickselect
• A limiting distribution for quicksort
• Asymptotic distribution theory for Hoare's selection algorithm
• A limit theorem for “quicksort”
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The quicksort process