The book “Algorithms. Construction and Analysis” succeeds in combining completeness of coverage and rigor of presentation. Many books on algorithms are rigorous, but suffer from a certain incompleteness; others cover a huge amount of material, but do not present it rigorously enough. This book covers a wide variety of algorithms, combines a wide range of topics with depth and completeness, and is accessible to readers of all backgrounds. Each chapter of the book is relatively self-contained and can be used as a separate topic of study. The algorithms in the book are described in simple human language and pseudocode, which can be understood by anyone who is even slightly familiar with programming, and explanations of their principles are given without excessive mathematical rigor and require only elementary knowledge.
Anyone can find in it the material that deals with the topic interesting to him, and presented at the level of complexity and rigor the reader requires.
The description of algorithms in natural language is supplemented by pseudocode, which allows anyone with at least basic programming knowledge and experience to implement an algorithm in the programming language they use. Rigorous mathematical analysis and an abundance of theorems are accompanied by plenty of illustrations, elementary reasoning, and simple approximations. The breadth of the material and the degree of rigor of its presentation make this book one of the best books devoted to algorithm development and analysis.