Category: (Book)
15 new, starting at $79.92
12 used, starting at $75.00
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.
the writing of the book is not goodReviewed by Ming Chen, 2010-02-20
The book always interprets each algorithm in English that cannot be easily understood. Sometime, after taking time to have understood the algorithm by myself, I found its english in this book is in a so a weird expression that even make the algorithm more confusing. At most time, the interpretation of some algorithm can be easier or more frank.
Good C++ text for college-level introduction to algorithmsReviewed by Brian Lawler, 2009-04-22
Good, solid, book on algorithms. Used in many college courses. Covers the material commonly found in a college-level introduction to algorithms course that comes after introduction to programming. Not as demanding in the algorithms as in T. Cormen et al. Does assume reader already has the basics of C++ programming. Covers standard C++ and does not focus on "Windows" C++ (e.g. MFC or C++.Net). Good book for a following ACM guidelines for a course on algorithms. Title says "algorithms" and "data structures" but better for an algorithms course and not so much for a data structures course.
I wish I had this when I was in collegeReviewed by Naseer Siddique, 2007-07-23
This book puts most of my college textbooks to shame. Not that they
were bad, but really this is a step above. Sedgewick is a master at
distilling difficult concepts into just a few lines of code, and
then talking the reader through all of the implications of any
design decision. For a professional who needs to reacquaint himself
with the basic principles of algorithms, and needs some simple code
to get started on coding a solution, this cannot be beat. While I
am not in school anymore, I feel this can also be a great
supplemental text for any serious Computer Science university
student, although it's possible that the focus on C++
implementations may not be ideal for curricula where Java is the
mainstay.
One of the factors that I did not see mentioned in other reviews is
that Sedgewick's visual representations of the algorithms are
phenomenal. In older algorithms textbooks, these have always been
represented by small diagrams--if any--that show what happens when
an algorithm is used to attack a small problem (say, a linked list
with 10 nodes). This text shows a visual representation of those
small cases, but then goes the extra mile to show visual
representations of the same algorithm when scaled to a variety of
massive inputs. These representations are a great tool for
comparing the scalability of various algorithmic approaches against
one another.
InterestingReviewed by José Miguel Serra Lleti, 2006-03-16
If you need a book to introduce yourself in data structures, thats
not your book. This books are for consult, not to learn, cos there
are leaks : insuficient code, insuficient large explanations and
drawings about TDAs. Furthermore, its expensive.
Even trough that, Id recommended part 5 because its a good
collection of the most used algorithms based in graphs.
If you want to _really_ understand red-black trees.....Reviewed by Randall Helzerman, 2005-06-07
Any professional programmer would benefit from having these books
at hand. Excellent discussions of the basic algorithms which every
programmer needs to know.
But I would like to particularly highlight the discussions on
binary and n-ary search trees. The most enlightening discussion in
print, giving the reader a real synoptic view of search tree
algorithms, how they evolved, and their culmination in red-black
trees.
Other reviewers have mentioned that the algorithms as presented
here seem to be just warmed=over versions of their C counterparts
presented in the C edition of this work. There is a germ of truth
to this, but I really don't consider it to be a valid criticism of
the books. The point here is not to present C++ coding techniques,
but to understand algorithms. If you want to know what a
state-of-the art C++ implementation of Red-Black trees looks like,
just read the source code which comes with the GNU compiler
toolchain. But you're not going to have a prayer of understanding
it until you first understand how Red-black trees work--that's
where this book comes in. If you are trying to explain the
Red-black tree algorithm, you don't want all of the C++ do-dads and
optimizations, templates, etc, all cluttering up the presentation
of the skeletal algorithm.
