Abstract

Typical computer science students study the basic sorting algorithms at least three times before they graduate:first in introductory programming,then in data structures, and finally in their algorithms course.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [CLRS01]
    T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge MA, second edition, 2001.MATHGoogle Scholar
  2. [KMS96]
    J. Komlos, Y. Ma, and E. Szemeredi. Matching nuts and bolts in o(n log n) time. In Proc. 7th Symp. Discrete Algorithms (SODA), pages 232–241, 1996.Google Scholar
  3. [Knu98]
    D. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading MA, second edition, 1998.Google Scholar
  4. [MR95]
    R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.MATHGoogle Scholar
  5. [MU05]
    M. Mitzenmacher and E. Upfal. robability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.Google Scholar
  6. [Raw92]
    G. Rawlins. Compared to What? Computer Science Press, New York, 1992.Google Scholar
  7. [Ski88]
    S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:775–784, 1988.CrossRefMathSciNetGoogle Scholar
  8. [Str69]
    V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14:354–356, 1969.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceState University of New York at Stony BrookNew YorkUSA

Personalised recommendations