Rating: 
Summary: Interesting but sloppily written
Review: This is a great book on the design of algorithms, emphasizing design over analysis. With perhaps 1/4 of mainframe machine cycles spent sorting, this is an important topic. The first part introduces those topics we forgot as computer science majors; "The Big Oh notation"; data structures, and heuristic methods. I got a lot from the section on dynamic programming, as well as the simulated annealing heuristic. He perhaps too quickly dispenses genetic algorithms. The discussion on "the theory of NP-Completeness" left me behind, but I would return to that section as a reference. The second part of the book is an impressive catalog emphasizing non-numeric algorithms. The accompanying CD adds great value to the book, with the complete book, a web site of algorithms, and audio class lecture.
Rating: 
Summary: A great resource for picking algorithms
Review: This is a great book on the design of algorithms, emphasizing design over analysis. With perhaps 1/4 of mainframe machine cycles spent sorting, this is an important topic. The first part introduces those topics we forgot as computer science majors; "The Big Oh notation"; data structures, and heuristic methods. I got a lot from the section on dynamic programming, as well as the simulated annealing heuristic. He perhaps too quickly dispenses genetic algorithms. The discussion on "the theory of NP-Completeness" left me behind, but I would return to that section as a reference. The second part of the book is an impressive catalog emphasizing non-numeric algorithms. The accompanying CD adds great value to the book, with the complete book, a web site of algorithms, and audio class lecture.
Rating:
Summary: very approachable
Review: This is the most approachable book on algorithms I have. Reading should not be a chore, and yet with some of the other algorithms texts, it very tiresome just to find what you are looking for... and you can just forget about understanding those on the first read-through!What I like about this book is that things are explained clearly without "dumbing down". When I have a quick question about a particular data structure or about which of two solutions would be better for a problem, I always reach for this book first. Money well spent.
Rating: 
Summary: The worest!
Review: This is the worest textbook that i hae ever seen! Do not apend ur money on it.
Rating:
Summary: Makes analysis of algorithms more fun...
Review: Very nicely written book... war stories keep reader interested all the time... would serve as a great companion to Corman's book... basically, can understand the algos. first with this book and get into greater details and proofs using Corman's book..
| 
