Textbook:
Cormen, Leiserson, Rivest, and Stein,
Introduction to Algorithms,
second edition
McGraw-Hill & MIT Press, 2001.
Authors' book homepage
We'll refer to it as "CLR" for short.
There is a CD-ROM version of CLR available from Dr. Dobbs Journal,
www.ddj.com
Some pros and cons:
Other references (see CLR for title, publisher, date).
Aho, Hopcroft, and Ullman: Classic algorithms text -- crystalized the topic.
Garey and Johnson: famous summary of NP Completeness, enumeration of many
NP complete problems.
Sedgewick: Well done text, interesting algorithm choice, well explained, weak on
analysis.