Introduction to Algorithms

A comprehensive book. Used a little of this book in my analysis of algorithm class. A good book for later reference

I'm very satisfied with this purchase. Fast delivery, perfect guarantee with complete coverage, %100 trust-worthy.
Thanks Amazon.

This book has the professional in mind, every page is simply explained ( in perspetive to the subject matter ). This isn't a beginner book for programmers, this is a beginner book for Algorithmic study, these are not the same matters; however, internally they are. If you are competent in coding the language, now it is time to break the bounds of coding and enter the world of programming. The only problem I have with this book is that it is sort of a cook book; it is not an exaustive teaching of algorithmic developement, it is more a history of algorithms that have been found useful in career.
Although this book is very light on each algorithm group, and does not require in-depth knowledge of the code to program it, it does however paint a good picture of how to use the algorithm; in contrast, the art of computer programming is much more exaustive but can be hard to follow if you don't know the uses of an algorithm.

Puzzle: "as easy as 123"; what is unique about this sentence?
hint; sometimes all of us wear masks to hide our identity, but sometimes it is the identity we hide that is the mask.

I have read two algorithms books (Van Gelder and CLR), and CLR is by far the best. The explanations are very clear and concise. The book also serves as an excellent reference as the subchapters are fairly self-contained, making it easy to read up on a small detail. If you are looking for a more detailed discussion on NP-completeness and computing theory, other books (e.g. Sipser or Hopcroft) are more appropriate.

This is actually a very good book to read - what they cover, they cover in depth, building each concept up from elementary concepts so you can always see how they got from point A to point B. The authors present mathematical proofs of essentially every assertion (although, as is typical of "discrete math" proofs, the proofs can sometimes be a tad on the silly side as they sometimes just restate whatever they're trying to prove - blame academia). The algorithms are all presented in a language-agnostic pseudocode which highlights the essentials of the algorithm itself without burdening the reader with language idiosyncracies. Plus, if you want something more concrete, the latest edition comes with a CD-ROM including all the algorithms implemented in Java!

So, this is an excellent reference on the subject of algorithms. But as a textbook? It's horrible. One of the worst. Although the book is replete with problems and questions, there are no answers provided. To any of them. You can't purchase an answers/solutions book. You can't look up the answers on a website. The authors are openly hostile towards anybody who might (imagine this?) want to verify whether or not they got the correct answer on any of the questions. The fact is, it's clear from the author's demeanor that they WANT YOU TO FAIL. They don't want you to be able to learn algorithms from this book - they intend it to be a thorough reference for anybody who already understands the subject material.

They defend their position by asserting that they can't provide answers to students since some professors copy the problems verbatim from the book onto their exams. (They even provide a professors-only solution guide for professors who assign problems that they themselves can't solve). Fortunately for me, I'm lucky enough to be taking a course taught by a professor who actually does understand his own material, and he's been kind enough to help me through the questions I can't figure out. It's a shame I have to waste so much of his time thanks to the utter arrogance of the authors of the textbook we use.

So, as long as you have another source to learn algorithms, this is an excellent reference. If you plan to learn, look elsewhere.