Asymptotic distributions for Random Median Quicksort

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 exponent...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 5; číslo 3; s. 592 - 608
Hlavní autori: Okasha, H.M., Rösler, U.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.09.2007
Predmet:
Analysis of algorithm
Contraction method
Divide-and-conquer algorithm
Euler differential equation
Quicksort
Recursive equation
Sorting algorithm
Stochastic fixed point equation
Euler differential equation
Recursive equation
Quicksort
Divide-and-conquer algorithm
Analysis of algorithm
Stochastic fixed point equation
Contraction method
Sorting algorithm
ISSN:1570-8667, 1570-8675
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:1570-8667
1570-8675
DOI:10.1016/j.jda.2006.07.003