This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.This book incorporates twice the tutorial material and exercises. It provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. It contains a highly unique catalog of the 75 most important algorithmic problems. It includes new "war stories" and "interview problems", relating experiences from real-world applications. Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals.

Table of Contents

Part I: Practical Algorithm Design. Introduction to Algorithms. Algorithm Analysis. Data Structures. Sorting and Searching. Graph Traversal. Weighted Graph Algorithms. Combinatorial Search and Heuristic Methods. Dynamic Programming. Intractable Problems and Approximations. How to Design Algorithms.- Part II: The Hitchhiker's Guide to Algorithms. A Catalog of Algorithmic Problems. Data Structures. Numerical Problems. Combinatorical Problems. Graph Problems: Polynomial-Time. Graph Problems: Hard Problems. Computational Geometry. Set and String Problems. Algorithmic Resources.- Bibliography.- Index.