Appendix D References
Chapter 1. Analysis Basics
Aho, A., Hopcroft, J., and Ullman, J. The Design and Analysis of Computer Algo-
rithms. Addison-Wesley, Reading, MA, 1974.
Baase, S. and Van Gelder, A. Computer Algorithms. Addison Wesley Longman,
Reading, MA, 2000.
Cormen, T., Leiserson, C., and Rivest, R. Introduction to Algorithms. McGraw-
Hill, New York, 1990.
Knuth, D. “Big Omicron and Big Omega and Big Theta,” SIGACT News,
8(2), pp. 18–24, 1976.
Parberry, I. Problems on Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1995.
Purdom, P. and Brown, C. The Analysis of Algorithms. Holt, Rinehart and Win-
ston, New York, 1985.
Sedgewick, R. Algorithms, 2d ed. Addison-Wesley, Reading, MA, 1988.
Chapter 2. Searching Algorithms
Knuth, D. E. The Art of Computer Programming: Volume 3 Sorting and Searching,
2d ed. Addison-Wesley, Reading, MA, 1998.
Chapter 3. Sorting Algorithms
Hoare, C. A. R. “Quicksort,” Computer Journal, 5(1), pp. 10–15, 1962.
Knuth, D. E. The Art of Computer Programming: Volume 3 Sorting and Searching,
2d ed. Addison-Wesley, Reading, MA, 1998.
Shell, D. L. “A High-Speed Sorting Procedure,” Communications of the ACM,
2(7), pp. 30– 32, July 1959.
Williams, J. “Algorithm 232: Heapsort,” Communications of the ACM, 7(6), pp.
347–348, 1964.