Introduction to Algorithms, 2nd ed. by Thomas H. Cormen (Editor), Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Published June 1990
List Price: $82.00, Your Amazon.com Price: $69.70
Average rating:
Amazon Sales Rank: 4,252
Buy it now:
Summary Considered to be the definitive text for learning algorithms, this text covers algorithm analysis and a wide range of commonly used algorithms.
I got this text as a requirement for my Algorithms course, and considering that Algorithms is a different course, than what most of what I have taken, I would say that a different approach is needed. This has a lot of good ideas, relating to algorithms, and it does give a fairly good mathematical basis for why this material works the way it does, although if you don't have the math background to look through it, or you can't understand pseudo-code, then this may not be a book you can benefit from.
One of the things I regret is that, since it is a textbook, some of the real goodies are 'left as an exercise to the reader'. For example, if I remember correctly, they give you the Strassen fast matrix multiply algorithm for matrices whose dimension is a power of two, but not the (non-trivial) general case.
The book is great, but it's not the perfect algorithm cookbook.
This is it! The Bible. This is one of those books that stays off the shelf more often than on. This was our text book for Algorithms and Data Structures. It is very thorough, covering all the popular algorithms and structures in a very approachable way. Some parts can be mathematically rigorous, but if I can get through it so can you! My only gripe is there is no place to obtain solutions to the problems in the book (I mean for instructors, not lazy students ;)).
Highly recommended.
This is THE standard textbook used in algorithm and datastructure courses all over the world.
It requires some mathematical maturity. This is not to say you need to to know alot mathematics, but you will need to think analytically.
Generally it's well written, while there are a few chapters that can be confusing (the part about dynamic programming was confusing to me, until the teacher covered it in his lecture, at which point i thought it was the simplest thing in the book/course).
The only serious draw back i can think of is that it doesnt have answers to exercises.
Conclusion:
If you are serious about programming, you will need this book. There are no real alternatives (except perhaps Knuths Art of computer programming). This review refers to the first edition.
I just bought this book and I can't put it down! So much info *drooling*
Only downside is that the author likes to talk for a LONG time and get little info across. (The book itself is a gem) This review refers to the first edition.
this book is my textbook for my Data Structures and Algorithms course for a year. I recommend every programmer this book. Heavy mathematical proofs and good reference. A must have... This review refers to the first edition.
This book is really the best book about algorithms and data structures. It contains many useful, widely used algorithms, together with their deep analysis. But be prepared for many mathematical proofs. This review refers to the first edition.
An excellent book for the newbie/learner. It teaches you everything you need. I recommend it to any highschool/college student (I'm in highschool), buy it as quickly as possible, and you'll be able to do a lot of things faster and better. This book rocks :) This review refers to the first edition.
This book was my textbook for a second year computer science class. As the previous reviewer noted, this book is heavy on mathematics and proofs. It's really the Analysis of Algorithms. But it includes a lot of common algorithms (searching, sorting, graphs, etc.). I recommend this book as a reference to analyzing your own algorithms. This review refers to the first edition.
Southwest Gaming Expo
Amazon.com
Amazon.co.uk
Amazon.ca
Amazon.de
Amazon.fr