Algorithms. A Guide to Development

The book is the most comprehensive guide to developing efficient algorithms. The first part of the book contains practical recommendations for algorithm development: it presents basic concepts, provides an analysis of algorithms, discusses types of data structures, primary sorting algorithms, graph traversal operations, and algorithms for working with weighted graphs, examples of combinatorial search, heuristic methods, and dynamic programming. The second part of the book contains an extensive list of literature and a catalog of 75 of the most common algorithmic problems, for which existing software implementations are listed.
The third edition has expanded the set of randomized algorithms, hashing algorithms, approximation algorithms, and quantum computing. More than 100 new problems have been added, with links to implementations in C, C++, and Java.
The book can be used as a reference guide to algorithms for programmers, researchers, and as a textbook for students of relevant specialties.