Algorithms: construction and analysis. 3rd edition. Kormen T. Kh., Leizerson Ch. And others

A number of books on algorithms are characterized by the severity of the presentation of the material, but suffers from certain incompleteness; Other books cover a huge volume of material, but do not strictly express it. This book successfully combines the fullness of the coverage and severity of the presentation. It describes the most diverse algorithms, combines a wide range of topics with the depth and completeness of the presentation; At the same time, the presentation is available to readers of a very different level of training. Each chapter of the book is relatively self -sufficient and can be used as a separate topic for study. The algorithms are described in simple language and using the pseudo -cod, which is understandable to anyone who is at least a small extent familiar with programming, and explanations of the principles of their work are given without excessive mathematical severity and require only elementary knowledge.

The first edition of this book has long been It has become a standard reference guide for professionals and a training manual for university students. The second edition was supplemented by new chapters that reveal such topics as probabilistic analysis and randomized algorithms, linear programming. The third edition is also significantly supplemented and revised. It included two completely new chapters dedicated to the trees of Van Emde Boas and multi -flow algorithms, and the chapter dedicated to recurrence has been significantly expanded. The presentation of such material as dynamic programming and greedy algorithms has been changed, and a new concept of stream based on the ribs in the material about transport networks has been introduced. Many new exercises and tasks were also added to the third edition.