THE Algorithms Book

This is widely considered the one algorithms book that every computer science should read. It covers a wide variety of algorithm topics from sorting to graph algorithms to NP completeness. It contains detailed descriptions of dozens of algorithms as well as complexity analysis for many of them. The book's biggest shortcoming in my opinion is the relatively high number of items that are left as an exercise for the reader, with no answers included. These items make for great problem sets in a classroom setting, but detract from the book's utility as a reference.

Other Reviews

• Good, but overrated
• THE Algorithms Book
• Authoritative book for algorithms
• Good quality, surprising speed
• Excellent for Mathematicians