Algorithms: construction and analysis

The book Algorithms: Construction and Analysis successfully combines completeness of coverage and rigor of presentation. Many books on algorithms are characterized by rigor but suffer from a certain incompleteness; other books cover a huge amount of material but are not rigorous enough. Algorithms: Construction and Analysis describes a wide variety of algorithms, combining a wide range of topics with depth and completeness of presentation, and is accessible to readers of a wide range of backgrounds. Each chapter of the book is relatively self-contained and can be used as a separate topic of study. Algorithms in the book Algorithms: Construction and Analysis are described in simple human language and with the use of pseudo-code, which is understandable to anyone who is even slightly familiar with programming, and explanations of the principles of their work are given without excessive mathematical rigor and require only elementary knowledge. The first edition of Algorithms: Construction and Analysis has long been a standard reference guide for professionals and a textbook for universities. The second edition has been updated with new chapters covering such topics as probabilistic analysis and randomized algorithms, and linear programming. The third edition has also been substantially expanded and revised. It includes two completely new chapters on van Emde Boas trees and multithreaded algorithms, and the chapter on recurrence has been significantly expanded. The presentation of such material as dynamic programming and greedy algorithms has been changed, and a new notion of edge-based flow has been introduced in the material on transportation networks. Many new exercises and problems have also been added to the third edition of Algorithms: Construction and Analysis. The fundamental work Algorithms: Construction and Analysis by renowned computer scientists deserves a place on the shelf of any person whose work is somehow related to computer science and algorithms: for a professional this book can serve as a desk reference, for a teacher - a guide to prepare for lectures and a source of interesting non-trivial problems, for undergraduate and graduate students - an excellent textbook. Everyone can find in it exactly the material that relates to the topic of interest and is presented with the level of complexity and rigor that the reader requires. The description of natural language algorithms is supplemented by pseudocode, which allows anyone with at least basic programming knowledge and experience to implement an algorithm in the programming language he or she uses. Rigorous mathematical analysis and an abundance of theorems are accompanied by a large number of illustrations, elementary reasoning, and simple approximations. The breadth of coverage of the material and the degree of rigor of its presentation give reason to consider this book one of the best books devoted to the design and analysis of algorithms. The third edition of this classic work has been extensively revised. There are new chapters, including those devoted to such an important topic as multithreaded algorithms, and the old ones have been revised, in some places quite substantially, when the material already available in the second edition is presented from a different perspective than before. This book will not be superfluous both on the desk of an undergraduate or graduate student and on the working shelf of a practicing programmer.