The textbook by Cormen, Leiserson, and Rivest is
by far the most useful and comprehensive reference
on standard algorithms.
- Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest
(1990) Introduction to Algorithms, MIT Press, Cambridge MA and
McGraw-Hill, New York.
When the analysis of an algorithm is not straightforward, you
may need some high-powered tricks. For these, see
- Sedgewick, Robert and Philippe Flajolet (1996) An Introduction
to the Analysis of Algorithms, Addison-Wesley, Reading MA.
For new techniques involving randomized algorithms, see
- Motwani, Rajeev and Prabhakar Raghaven (1995) Randomized
Algorithms, Cambridge Univ. Press, Cambridge UK (ISBN 0-521-47465-5).
- Mulmuley, Ketan (1994) Computational Geometry: An Introduction
through Randomized Algorithms, Prentice-Hall, Englewood Cliffs NJ
Obviously, even a book as large as Cormen cannot cover all useful
algorithms. We have additional information on: