Algorithms in C++ 3 ed. Nd

Sedgewick's landmark works on computer algorithms for C++ -- thoroughly revised, and bundled at a special price! Today's most efficient algorithms for sorting, searching, graphing, and data structures. New edition- completely rewritten and greatly expanded with nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs!
Bridges the gap between theory and practice with carefully chosen examples, detailed figures, and complete implementations. 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.
Robert Sedgewick is Professor of Computer Science at Princeton. He received his Ph.D. from Stanford University under Donald E. Knuth. A Director of Adobe Systems, he has served on the research staffs of Xerox, PARC, the Institute for Defense Analysis, and INRIA. He co-authored An Introduction to the Analysis of Algorithms.