Algorithms

In this book, intended for students of mathematical and programming specialties (starting from junior courses), the main methods of building and analyzing effective algorithms are analyzed in detail. It is based on the lectures of the authors at the universities of San Diego and Berkeley. The choice of material is not quite standard (say, about sorting and data structures associated with storage of ordered sets in balanced trees, it is not said, but linear programming and even quantum calculations are discussed) The authors tried to highlight the main ideas and state evidence clearly, without abusing formalism, but even without sacrificing mathematical severity, the original approach of the authors makes the book interesting not only to students, but also to experienced teachers. Each section is equipped with exercises