Asymptotic distributions for Random Median Quicksort

Authors:
H. M. Okasha;U. Rösler
Affiliations:
Mathematics Department, Al-Azhar University, Cairo, Egypt;Mathematisches Seminar, Christian-Albrechts Universität zu Kiel, Ludewig-Meyn-Str. 4, D-24098 Kiel, Germany
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 4
Cited 0

Algorithms

Algorithms
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Increasing the efficiency of quicksort

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponential moments. The asymptotic distribution is characterized by a stochastic fixed point equation. The basic technic will be generating functions and the contraction method.