Advances in Applied Probability

Distributional convergence for the number of symbol comparisons used by QuickSelect

James Allen Fill and Takehiko Nakama

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

When the search algorithm QuickSelect compares keys during its execution in order to find a key of target rank, it must operate on the keys' representations or internal structures, which were ignored by the previous studies that quantified the execution cost for the algorithm in terms of the number of required key comparisons. In this paper we analyze running costs for the algorithm that take into account not only the number of key comparisons, but also the cost of each key comparison. We suppose that keys are represented as sequences of symbols generated by various probabilistic sources and that QuickSelect operates on individual symbols in order to find the target key. We identify limiting distributions for the costs, and derive integral and series expressions for the expectations of the limiting distributions. These expressions are used to recapture previously obtained results on the number of key comparisons required by the algorithm.

Article information

Source
Adv. in Appl. Probab., Volume 45, Number 2 (2013), 425-450.

Dates
First available in Project Euclid: 10 June 2013

Permanent link to this document
https://projecteuclid.org/euclid.aap/1370870125

Digital Object Identifier
doi:10.1239/aap/1370870125

Mathematical Reviews number (MathSciNet)
MR3102458

Zentralblatt MATH identifier
1278.68354

Subjects
Primary: 60F25: $L^p$-limit theorems
Secondary: 68W40: Analysis of algorithms [See also 68Q25]

Keywords
QuickSelect QuickQuant QuickVal limit distribution almost-sure convergence L^p-convergence symbol comparison probabilistic source

Citation

Fill, James Allen; Nakama, Takehiko. Distributional convergence for the number of symbol comparisons used by QuickSelect. Adv. in Appl. Probab. 45 (2013), no. 2, 425--450. doi:10.1239/aap/1370870125. https://projecteuclid.org/euclid.aap/1370870125


Export citation

References

  • Billingsley, P. (1995). Probability and Measure, 3rd edn. John Wiley, New York.
  • Chung, K. L. (2001). A Course in Probability Theory, 3rd edn. Academic Press, San Diego, CA.
  • Clément, J., Flajolet, P. and Vallée, B. (2001). Dynamical sources in information theory: a general analysis of trie structures. Algorithmica 29, 307–369.
  • Devroye, L. (1984). Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29, 1–7.
  • Devroye, L. (2001). On the probablistic worst-case time of “Find”. Algorithmica 31, 291–303.
  • Fill, J. A. (2013). Distributional convergence for the number of symbol comparisons used by QuickSort. Ann. Appl. Prob. 23, 1129–1147.
  • Fill, J. A. and Janson, S. (2012). The number of bit comparisons used by Quicksort: an average-case analysis. Electron. J. Prob. 17, 22pp.
  • Fill, J. A. and Nakama, T. (2010). Analysis of the expected number of bit comparisons required by Quickselect. Algorithmica 58, 730–769.
  • Grübel, R. (1998). Hoare's selection algorithm: a Markov chain approach. J. Appl. Prob. 35, 36–45.
  • Grübel, R. and Rösler, U. (1996). Asymptotic distribution theory for Hoare's selection algorithm. Adv. Appl. Prob. 28, 252–269.
  • Hoare, C. A. R. (1961). Find (algorithm 65). Commun. ACM 4, 321–322.
  • Hwang, H.-K. and Tsai, T.-H. (2002). Quickselect and the Dickman function. Combinatorics Prob. Comput. 11, 353–371.
  • Knuth, D. E. (1972). Mathematical analysis of algorithms. In Information Processing 71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1, North-Holland, Amsterdam, pp. 19–27.
  • Lent, J. and Mahmoud, H. M. (1996). Average-case analysis of multiple Quickselect: an algorithm for finding order statistics. Statist. Prob. Lett. 28, 299–310.
  • Mahmoud, H. M. and Smythe, R. T. (1998). Probabilistic analysis of multiple Quick Select. Algorithmica 22, 569–584.
  • Mahmoud, H. M., Modarres, R. and Smythe, R. T. (1995). Analysis of Quickselect: an algorithm for order statistics. RAIRO Inf. Théor. Appl. 29, 255–276.
  • Paulsen, V. (1997). The moments of FIND. J. Appl. Prob. 34, 1079–1082.
  • Prodinger, H. (1995). Multiple Quickselect–-Hoare's Find algorithm for several elements. Inform. Process. Lett. 56, 123–129.
  • Régnier, M. (1989). A limiting distribution of quicksort. RAIRO Inf. Théor. Appl. 23, 335–343.
  • Rösler, U. (1991). A limit theorem for “Quicksort”. RAIRO Inf. Théor. Appl. 25, 85–100.
  • Rösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29, 3–33.
  • Ross, S. (2002). A First Course in Probability, 6th edn. Prentice-Hall, Upper Saddle River, NJ.
  • Vallée, B., Clément, J., Fill, J. A. and Flajolet, P. (2009). The number of symbol comparisons in QuickSort and QuickSelect. In Automata, Languages and Programming (Lecture Notes Comput. Sci. 5555), Part I, Springer, Berlin, pp. 750–763.