Algorithms. Development Guide

The book is the most complete guide to develop effective algorithms. The first part of the book contains practical recommendations for the development of algorithms: the basic concepts are given, the analysis of algorithms is given, the types of data structures are considered, the main sorting algorithms, counting operations and algorithms for working with suspended columns, examples of the use 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 tasks for which existing software implementations are listed.
In the third edition, a set of randomized algorithms, hashing algorithms, approximation and quantum calculations has been expanded. More than 100 new tasks have been added, links to realations on C, C ++ and Java are given.
The book can be used as a reference book on algorithms for programmers, researchers and as a training manual for students of relevant specialties.
3rd ed