C++ algorithm books

Hey everyone, I was looking for some good problem solving books for C++ and came across "Algorithms in C++" by Robert Sedgewick. Any recommend this book or have any gripes about it? Also, anyone know of any other great books for a semi-newbie that explores algorithms and problem solving? Thanks!

personally I dont like sedgewicks book at all. I would instead though suggest these three books...

Introduction to data structures and algorithms with c++ by Glenn Rowe.

Data structures and algorithm analysis in c++ by Mark Weiss.

Data structures and problem solving with c++ by Mark Weiss.

For semi-newbies:

C++ Data Structures book by D. Malik - Course Technology

Also, Schaums DS with C++ Hubbard- McGraw Hill

I have more advanced texts- for non newbies- but these should get you started.

Also, Sedgewick is Ok, I would not personally teach out of it. Rowe and Weiss book are Ok as well.

I think Sedgewick is not a bad book. However, whomever is responsible for coding the examples should be shot in the face. Actually, it says "with C++ consulting by Christopher J. Van Wyk" so there you have it.

I'm a fan of Sedgewick's book, but not the code examples.

-Prelude

What exactly is the problem with Sedgewicks books? Since this is the only book at my bookstore dealing with algorithms, it would be nice to have something concrete wrong with it before searching solely on the web. Also, Mister C - do the books that you recommend get into any problem solving techniques? Thanks all!

>What exactly is the problem with Sedgewicks books?
The code examples exhibit bad style. They obviously aren't meant for production code, but that is never mentioned anywhere...some of them also use void main. As long as you take the code examples with a grain of salt, the book is excellent and very thorough. The best part is that Sedgewick's book is far more readable than Knuth's, which is the only algorithms book more detailed that I have seen.

-Prelude

Well, considering I plan on doing most of my own examples to learn instead of copying from the book, then Sedgewick's book sounds just fine for me. Thanks Prelude! Amazing how often you help me out!

Stone_Coder (or anyone!), I just searched on the web and found some cheap versions of Weiss's books, but they were all old editions (like 1994 and 1996). Do you know if there's much difference between these editions and the latest updates? The newest editions were a little pricey considering shipping has to be included...

Sorry, for not getting back sooner. The Malik does a little bit (problem solving). The Hubbard does not. They both cover the wide range of data structure topics- and how to use them.

Most DS books already assume you know how to problem solve already.

Thanks! I found a Sedgewick book on PDF but its rather old and uses Pascal It looks like I'm gonna buckle down and just get the new one at the bookstore!

I have his algorithms in C++ book and it is decent, but for a novice to intermediate programmer. If you have a lot of expirience under your belt, you could go with soemthing a little more complicated.

Unless you consider two months as having lots of experience, I'm definately a newbie! I skimmed Sedgewicks book and it looked pretty good, so I think I'll get it.

The best part is that Sedgewick's book is far more readable than Knuth's, which is the only algorithms book more detailed that I have seen.

I found Introduction to Algorithms to be one of the best. Sedgewick's code is really too compressed. It's
as if he's try to fit it all in one page. Weiss's books are
too light on analysis and they use c++/c code depending
on which one you get. The analysis
that is used is not explained really well. Introduction to Algorithms really goes to great lengths to
make the mathematics self contained.

>Sedgewick's code is really too compressed.
That's a good thing for a book like this. You can move through the code without getting lost after flipping 6 pages. Though that may just be me. I don't think it is a good introductory book, unless you are well versed with some form or programming or higher mathematics.

-Prelude

That's a good thing for a book like this. You can move through the code without getting lost after flipping 6 pages.

Well 6 pages per algorithm is Weiss's book. Really few
of the algorithms in Introduction to Algorithms are
more than a page.

I don't think it is a good introductory book, unless you are well versed with some form or programming or higher mathematics.

I'm not well versed in mathematics, but I can see someone having a tough time with it. It's not nearly as bad as Knuth's though.