In any case, to answer your question, I read the book a few years ago and thought it was really good. I don't remember there being many mistakes, and I didn't mention any in my review on Amazon, but I may have just not noticed.
It's definitely my favorite algorithms book, because it's more practical than books like Intro to Algorithms and TAOCP. A large portion of those books are dedicated to proving theorems and big-O run times, and things like that. This book skips over most of the proving and math, tells you what the big-O run time is, gives an implementation in C, walks through the algorithm in a way that actually explains what it's doing, and points to other resources for the deeper math.
If I needed to implement an algorithm, I'd grab this book. If I was curious about the math behind it, I'd grab TAOCP or Intro to Algorithms.
On the other end, CLRS is far from perfect. My two issues with CLRS are:
1. Many critical topics are missing entirely while lot of non-critical stuff have gotten in to. There is a discussion started out by Professor Corman at Quora for suggestions for 4th edition here: http://www.quora.com/As-we-start-planning-the-next-edition-o...
2. CLRS doesn't often try to make you understand the topic or algorithm. For example, for BST it will just say this is how you find successor node and it's entirely your job to think why this is the best way or why other alternatives won't be good. The way I deal with this is stop reading after chapter introduction and think about for a while how I would have solved problem and then read explanation in the book. This often illuminates subtle points of algorithms. I ended up annotating huge swath of text in my own PDF copy.
I've always found it far easier to scan through some psuedo-code and read a few paragraphs explaining it. At this point, I can usually look at the loops, recursive calls, and "structure", and get a pretty good idea of how it's working, what it's big-O run time would be, and why. Full blown formal proofs and theorems just don't help my understanding.
I agree the math is important for research and writing papers, and proving one algorithm is better than another, but for practical purposes (i.e. actually implementing an algorithm in real code) it's just not very helpful. And the reality is that most people learning about algorithms are going to spend a lot more time implementing algorithms than they will writing papers and doing algorithm research, so I'm not sure a math heavy book like CLRS is really the best undergraduate text.
I think a good example of this problem is Numerical Recipes. It's got a 4.5 in Amazon UK, slightly lower in Amazon US. Many people agree that it's not a good book - the main issue is that the authors apparently have little expertise in the areas they're professing to claim expertise in.
http://www.stat.uchicago.edu/~lekheng/courses/302/wnnr/nr.ht...
I'm sure Skiena knows his stuff, so that doesn't worry me, but it's entirely possible that people miss the mistakes. I'd just like to know why people gave such bad reviews.
Specifically, I'll usually look at Sedgwick's Stanford mooc videos if I need a refresher, but if I need a big-picture look to see what algorithms I should consider using, this book is the starting point. There are some bigger, all-inclusive type books but Skiena does a good job of being accessible, covering a lot of ground, and providing references to implementations and further reading.
> My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace (and important) graph problems are – they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. But the gold mine is the second half of the book, which is a sort of encyclopedia of 1-pagers on zillions of useful problems and various ways to solve them, without too much detail. Almost every 1-pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types.
Source: http://steve-yegge.blogspot.com/2008/03/get-that-job-at-goog...
I personally believe understanding intuition and theory are more important than simply being able to recite an algorithms implementation.
He didn't get the job at Google unfortunately, but he did get a job in ESA's flight dynamics team which I think is far cooler.
Amazon reviews are quite scathing for this book, people complain about poor explanations and lots of mistakes. Apparently there's a long errata, but even in 2012 people were moaning.
Can anyone corroborate this? There's also a camp of people that says it's one of the best books around. I've got Intro to Algorithms on my bookshelf here which is a doorstop, but not bad in a pinch if I want something other than google.