Partial Quicksort and weighted branching process
Mahmoud Ragab
Broschiertes Buch

Partial Quicksort and weighted branching process

Surveys & Analysis

Versandkostenfrei!
Versandfertig in 6-10 Tagen
33,99 €
inkl. MwSt.
PAYBACK Punkte
17 °P sammeln!
Quicksort was chosen as one of the 10 most important algorithms. Quicksort serves also as a challenging random divide-and-conquer algorithm for a mathematical analysis. Starting with the worst case, the best case and the expected running time. In this book we look at two different models of sorting algorithms. Quicksort algorithm, sorts an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. We know nowadays much finer results on the limiting distribution, the existence via martingale methods and a characterization as a stochastic fixed ...