Bundle of Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) [Paperback]

Robert Sedgewick (Author)

Book Description

Publication Date: January 7, 2002 | ISBN-10: 020172684X | ISBN-13: 978-0201726848 | Edition: 3

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.

Editorial Reviews

From the Back Cover

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, at a special discounted price. 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.

020172684XB07112001

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

020172684XAB06262002

Product Details

• Paperback: 1200 pages
• Publisher: Addison-Wesley Professional; 3 edition (January 7, 2002)
• Language: English
• ISBN-10: 020172684X
• ISBN-13: 978-0201726848
• Product Dimensions: 9.3 x 8.1 x 2.1 inches
• Shipping Weight: 4.5 pounds (View shipping rates and policies)
• Average Customer Review: 4.2 out of 5 stars  See all reviews (28 customer reviews)
• Amazon Best Sellers Rank: #301,715 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

51 of 51 people found the following review helpful:

5.0 out of 5 stars Excellent, Exhaustive (but not rigorous), October 20, 2001

By 

Optimistix (New York City) - See all my reviews

This review is from: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition (Paperback)

If you're looking for an exhaustive, upto-date reference/textbook for
fundamental, searching and sorting algorithms, then this is one of
the very best available.

Sedgewick has split his popular book into two volumes, with Graph
algorithms being hifted to the second volume. Moreover, many advanced
topics like computational geometry, fft, number theoretic algorithms
etc, which were introduced in the previous edition, seem to be missing
now - so the breadth of coverage seems to have reduced, which is a pity.

However, the depth has increased instead - i doubt that even Knuth
covers more sorting algorithms ! In particular, there are several
recent algorithms and data structures which are treated in greater
detail here than by Knuth. Of course, Knuth analyses all the
algorithms he presents in rigorous and exhaustive detail, which
this book doesn't.

Moreover, the book has many new algorithms and presents the state of the
art in sorting and searching algorithms, giving it a distinct advantage
over the older books.

Sedgewick makes it very clear in the preface that the emphasis is on
the practical importance of the algorithms, so esoteric algorithms which
are important 'only in theory' may find no mention. Also the emphasis is
more on the design of algorithms than on their analysis.

The number of (exercise!!) problems has multiplied manifold in this edition
to become more than most competing textbooks. Problems are graded by
difficulty level to help you choose the ones relevant to your needs.

The exposition is clear and authoritative - Prof. Sedgewick is a leading
authority in the field of algorithms and a student of Donald Knuth.
He has a gift for making difficult concepts seem simple, and the great
illustrations in the book go a long way in explaining the behaviour of
the algorithms.

For the practising professional, this is an ideal reference, since it'll
help you select the best algorithm for your task without bogging you
down with heavy mathematics.

The reasearcher, on the other hand, may benefit by gaining unique insights
from a master of the area, while using other books for the detailed
analysis of algorithms, including prehaps Sedgewick's own book on the
analysis of algorithms(with Flajolet).

A caveat - the code may not be 'ready to run'. It's better not to rely
on this book to provide you with usable code - if that is what you want,
perhaps the books by Drozdek/Weiss/Heileman/Rowe might be better choices.

If you want C code rather than C++, then the C version of this book is
a good choice, since the code provided is of 'K & R' class and therefore
a delight to read.

Of course, if you're looking for a language independent coverage,
then 'Introduction to algorithms' by Cormen,Leiserson and Rivest is
possibly the best book which combines rigor with comprehensive coverage
of the most important algorithms. Look out for the newly released
second edition.

And if you want a more rigorous and equally exhaustive coverage of
sorting and searching, go for Knuth vol.3 - still the authoritative
reference, though it may require more hard work on the reader's part.

Otherwise, invest in this and you won't be disappointed.

46 of 49 people found the following review helpful:

3.0 out of 5 stars Deceiving after "Algorithms in C", December 29, 2000

By 

Rubens Altimari (Sao Paulo, Brazil) - See all my reviews
(REAL NAME)   

This review is from: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition (Paperback)

I can't honestly give less than 3 stars, since this series is one of the best on algorithms I ever had. But, having two editions, including the last one, of "Algorithms in C", by the same author, I thought this C++ version would be a revelation. But it is not! It gives the impression that he just exchanged "printf" for "cout <<"! I thought he would use C++ specific structures to enhance the algorithms (at least that is what I've expected), but it's just another slightly different version of the same book. I wish I knew beforehand... If it's your first book by Sedgewick, though, I guess it's a good option.

26 of 26 people found the following review helpful:

4.0 out of 5 stars I've read the rest and this one is the best., April 3, 1999

By A Customer

This review is from: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition (Paperback)

Algorithms in C++ Parts 1-4:

After an exhaustive review of nearly every book available on data structures and algorithms (including the seminal "Art of Computer Programming"), and after a considerable reduction in my bank account, I can safely say that this is the best book available on these topics - period.

I rate a book on the basis of how close it comes to being the ONLY book that is needed to completely cover the subject matter. This is actually an almost unattainable goal for an author but this is the test I use. Writing style, clarity of communicating ideas, organization of the material, depth of coverage, practicality, and usability are all crucial elements of that goal and marks a book that will retain its value over time.

This book comes closer to reaching that goal than any other book I've read. I do have a minor complaint about this book and that is the particular coding style that Dr. Sedgewick uses. I am always diligent about writing clear, self-documenting, and visually appealing code whereas Dr. Sedgewick's code is, perhaps from necessity, rather abbreviated. For example, I've always preferred to use meaningful variable names, not just X or Y and am careful to use indentation to improve code readability etc. etc. This is a minor complaint however, and does not affect the usability of the code.

By the way, I do have one other complaint about which I have tried to contact Dr. Sedgewick: WHEN WILL THE SECOND VOLUME BE AVAILABLE!?