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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge MA, second edition, 2001.
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.
D. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading MA, second edition, 1998.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
M. Mitzenmacher and E. Upfal. robability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
G. Rawlins. Compared to What? Computer Science Press, New York, 1992.
S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:775–784, 1988.
V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14:354–356, 1969.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Skiena, S.S. (2012). Sorting and Searching. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-84800-070-4_4
Publisher Name: Springer, London
Print ISBN: 978-1-84800-069-8
Online ISBN: 978-1-84800-070-4
eBook Packages: Computer ScienceComputer Science (R0)