This newly expanded and updated second edition of the best-selling classic continues to take the mystery out of designing algorithms, and analyzing their efficacy and efficiency. Expanding onthe first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.
The reader-friendlyAlgorithm Design Manualprovides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part,Techniques, provides accessible instructionon methods for designing and analyzing computer algorithms. The second part,Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.NEWto the second edition:Doubles the tutorial material and exercisesover the first edition
Providesfull online supportfor lecturers, and acompletely updated and improvedwebsite component with lecture slides, audio and video
Contains aunique catalogidentifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve themIncludes severalNEW war stories relating experiences fromreal-world applications
Provides up-to-date links leading to the very best algorithmimplementationsavailable in C, C++, and Java
