The book is the most comprehensive guide to developing effective algorithms. The first part of the book contains practical recommendations for developing algorithms: basic concepts are given, an analysis of algorithms is given, types of data structures, basic sorting algorithms, graph traversal operations and algorithms for working with weighted graphs are considered, examples of the use of combinatorial search, heuristic methods and dynamic programming. The second part of the book contains an extensive bibliography and a catalog of 75 of the most common algorithmic problems, for which existing software implementations are listed.

The third edition expands the range of randomized, hashing, approximation, and quantum computing algorithms. More than 100 new problems have been added, links to implementations in C, C++ and Java are provided.

The book can be used as a reference book on algorithms for programmers, researchers and as a teaching aid for students of relevant specialties.