论文信息 - Partial Quicksort and Quickpartitionsort

Partial Quicksort and Quickpartitionsort

Partial Quicksort sorts the $l$ smallest elements in a list of length $n$. We provide a complete running time analysis for this combination of Find and Quicksort. Further we give some optimal adapted versions, called Partition Quicksort, with an asymptotic running time $c_1l\ln l+c_2l+n+o(n)$. The constant $c_1$ can be as small as the information theoretic lower bound $\log_2 e$.

Conrado Martínez | Uwe Rösler

[1] Alfredo Viola,et al. Adaptive sampling strategies for quickselects , 2010, TALG.

[2] Cristian S. Calude,et al. Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[3] P. Blanchard,et al. Dynamics of Complex and Irregular Systems: Bielefeld Encounters in Mathematics and Physics VIII , 1993 .

[4] R. Bass,et al. Review: P. Billingsley, Convergence of probability measures , 1971 .

[5] Alfredo Viola,et al. Adaptative sampling strategies for Quickselect , 2004 .

[6] U. Rösler. A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..

[7] Uwe Rr Osler,et al. A Limit Theorem for "quicksort" , 1999 .

[8] Uwe Rösler,et al. On the analysis of stochastic divide and conquer algorithms , 2001, Algorithmica.

[9] Rudolf Grübel,et al. On the median-of-K version of Hoare's selection algorithm , 1999, RAIRO Theor. Informatics Appl..

[10] Uwe Rösler,et al. The contraction method for recursive algorithms , 2001, Algorithmica.

[11] C. SIAMJ.. OPTIMAL SAMPLING STRATEGIES IN QUICKSORT AND QUICKSELECT , 2001 .

[12] Uwe Rr Osler. A Fixed Point Theorem for Distributions , 1999 .

[13] Rudolf Grübel,et al. Asymptotic distribution theory for Hoare's selection algorithm , 1996, Advances in Applied Probability.

[14] Uwe Rr Osler. The Contraction Method for Recursive Algorithms , 1999 .

[15] U. Roesler,et al. The Analysis of Find or Perpetuities on Cadlag Functions , 2007 .