Rating: 
Summary: A Good Book not for Beginers.
Review: The Authors have done a good job. They could have included good amount of examples in the first part which introduces Mathematical Background required. The Psudo code forms an excellent part of the book which will be more useful in implementing the algorithms as a computer program. The analysis of the algorithms are bit too lengthy. If the authors could come out with an answer book for the excercises, then this book serves its ultimate purpose.
Rating: 
Summary: Very Comprehensive....
Review: This is a very fine text on Algorithms. I was looking for a book explaining text search algorithms like Boyer Moore, etc. This was one book which covered them and it covered them well. A very good reference overall.
Rating:
Summary: A must for every computing professional
Review: This is not only a fine textbook for an academic course but also THE reference on algorithms for every programmer's library. It covers both general theory and loads of specific examples. The presentations are readable by anyone having a command of U.S. high-school mathematics. I've owned it for several years and I refer to it often.
Rating: 
Summary: Captivating... Masterful... (unless you have a life)
Review: Though quite thorough, this book is a "textbook example" of how boring the subject of computer science can be. Instead of touching on new technologies, such as AI, graphics, or anything else remotely relevant to today's demands on programmers and designers, this book, faithful to its MIT roots, gives a pompous, eggheaded distortion to the field of computers as a whole. Its focus is mainly on such trivialities as algorithm analysis, offering about 10 pages of proofs for each simple assertion. The points that the authors hope to make have no relevance whatsoever in a world in which processor power, not meticulous code optimization, reigns. This book is a waste of matter and not worth the paper it is printed on.
Rating:
Summary: Excellent reference for all programmers!!
Review: This is the definative quide to computer algorithms. It is not to be construed as an introduction by any means. It is an exhaustive text that answered all my questions that I had in college. The author uses pseudocode to illustrate the ideas and concepts which is benefical if you program in more than one language. It is the most widely used reference that I use in regard to algorithms. I highly recommend this book to those who are really serious about computer science and the study of algorithms. This book is not for novices. Some background in computer programming is required. Best computer alogrithms book I have ever seen so far.
Rating:
Summary: Good, but...
Review: It does show its age - there's not a great deal on neural nets or genetic algorithms for example.Also, it's available in paperback (maybe not on Amazon?) so shop around...
Rating:
Summary: I LOve This Book, But...
Review: But if they say an algorithm runs in n*logn, then I believe them...I don't need three pages of proofs. Other than that, very excellent read and very easy to follow pseudo-code examples.
Rating:
Summary: Must Own Book
Review: I've had this book for over seven years. The best buy of a computer science book for me. It was great when I was a student and its still useful now that I'm a professional. Definetely a book that should be on your shelf.
Rating:
Summary: A Fantastic book on the study of algorithms!
Review: This book is a must have for anyone that is going into the Computer Science field. It covers the realm of algorithms throughly and completely. The author covers the book in a complete manner that is enjoyable to read. This is also an excellent reference book for those already in the field of Computer Science.
Rating:
Summary: An excellent text of moderate difficulty
Review: An excellent survey of the field of algorithms. From a mathematical perspective its lighter than Knuth and heavier than Sedgewick. If your algebra is rusty you'll have some problems, but you don't have to be a math whiz either. If your just looking for an algorithm "cookbook" you'd be better off with something else, but if you're looking to gain a very solid "undergraduate" level understanding in algorithms you couldn't do any better.
| 
