Rating: 
Summary: Excellent book
Review: The pseudo code in this book is very efficient and easy to implement. It saves me much time in coding. This book covers a wide range of different areas. I used it when I was in graduate school. I am still using it at my work. In addition to efficient pseudo code, it provides a theoretical analysis of performance. So I can choose the optimal data structures and algorithms for different applications.
Rating: 
Summary: Algorithms and Data Structures on a Math Foundation
Review: I found this book particularly useful in learning the math and benchmark numbers that go along with many frequently used algorithms and data structures. It gives you a strong base for understanding the optimization process. It is well structured by chapters and topics so you will easily find your way through the book. I think you will write better code after reading this book (not because it will take you 10 years to read it :).
Rating: 
Summary: More Suitable for Math Majors than CS Students
Review: If you're not very strong in math, take the advice of the reviewer who recommended a companion textbook on Summations and Logarithms. Much of the text and exercises revolve around proofs that might be easily understandable to math majors, but very hard to follow for me (CS major). I would prefer to have more diagrams and less mathematical formulas.
Rating:
Summary: Best all-around book of its sort
Review: I have been teaching undergrad and graduate Computer Science for about a decade, and on those occasions when I have tried other books for my Algorithms courses, both my students and I find ourselves saying that we should have used that big white one.
Rating:
Summary: Not advanced enough
Review: This book doesn't cower enough, and is full of bull. They should have made it 800 pages shorter, and covered more advanced algorithms. (since I'm only a second year CS student I can't imagen this book beeing of practical use for advanced users )
Rating:
Summary: Great book!
Review: I loaned it to my son to supplement his college course on algorithms. He carries it to class every day (which is quite an endorsement given its size and weight) and uses it instead of the approved text. He informed me last week that I wasn't getting it back, so I have to buy a new one.I also liked it, too! The authors use psuedo-code which can be translated into the language of choice. Performance issues are covered well.
Rating:
Summary: simply superb
Review: For anyone new its a must. can be recommended blindly. I have read it at stanford. simply superb.
Rating: 
Summary: Not a book for beginners
Review: A great advanced book. For a beginner, I am going to find something else
Rating:
Summary: A staple for every programmer
Review: I consult this book several times a year, not in support of research but for everyday business application development, and I continue to find it impressively thorough and understandable. I disagree with those earlier reviewers who found it mathematically daunting. I found nothing that would be beyond college freshmen math. It relies on the reader's grasp of mathematical induction and it uses summation and combinatorial notations, of course, but how could one present these topics any other way?
Rating:
Summary: Good book...
Review: AS a CS student, we had this book reccommnded for our data structures and our algorithms design courses. It was really usefull foor the algorithms design course (although I hadn't compared it to any other book...) but I did find a better book for the data structures course...
| 
