Product Description

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.

---

Product Details

• Amazon Sales Rank: #489373 in Books
• Published on: 2002-01-07
• Original language: English
• Number of items: 1
• Binding: Paperback
• 1200 pages

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

---

Customer Reviews

A classic in the making
Ok, so maybe some of the code examples aren't perfect but then I hardly ever use C++ and didn't buy the book to copy the code. I wanted to understand the algorithms and couldn't have bought a better book for the purpose.

This is the book I turn to when I have coding problems - no matter what language I happen to be using at the time.

Having said this, I should also point out that a knowledge of elementary C++ programming is a pre-requisite.

A very good and explaining book for begginers on algorithms
When I bought this book I didn't know anything about algorithms. This book helped me to learn developing various types of algorithms. The bad stuff is that part 5-8 is not published yet. This book is analytical and methodical so anyone can learn programming algorithms. I like it very much.

Excellent text, but very terse code examples
This book is very good indeed as far as the text goes, but why not put some more effort into making the code more readable? I would have found the book much more useful if I could have dipped into the code examples for inspiration without having to decipher them first.