Algorithms. A Guide to Development

The book is the most comprehensive guide to developing effective algorithms. The first part of the book contains practical recommendations for algorithm development: it provides key concepts, analyzes algorithms, discusses types of data structures, basic 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 expands the set of randomized algorithms, hashing algorithms, approximation, and quantum computing. More than 100 new problems have been added, and references to implementations in C, C++, and Java are provided. The book can be used as a reference guide to algorithms for programmers and researchers and as a textbook for students in relevant fields.