Lange K. Algorithms from THE BOOK 2020 torrent

Textbook in PDF format

My inspiration for writing a survey of the best algorithms can be summarized by quoting Martin Aigner and Günter Ziegler, whose splendid book Proofs from THE BOOK is now in its sixth edition (см.: /file/2555508/). They write:
Paul Erdós liked to talk about THE BOOK, in which God maintains the perfect proofs for mathematical theorems, following the dictum of G.H. Hardy that there is no permanent place for ugly mathematics.
Algorithms are a dominant force in modern culture, and every indication is that they will become more pervasive, not less. The best algorithms are undergirded by beautiful mathematics. This text cuts across discipline boundaries to highlight some of the most famous and successful algorithms. Readers are exposed to the principles behind these examples and guided in assembling complex algorithms from simpler building blocks. Written in clear, instructive language within the constraints of mathematical rigor, Algorithms from THE BOOK includes a large number of classroom-tested exercises at the end of each chapter. The appendices cover background material often omitted from undergraduate courses. Most of the algorithm descriptions are accompanied by Julia code, an ideal language for scientific computing. This code is immediately available for experimentation. Algorithms from THE BOOK is aimed at first-year graduate and advanced undergraduate students. It will also serve as a convenient reference for professionals throughout the mathematical sciences, physical sciences, engineering, and the quantitative sectors of the biological and social sciences.
Preface.
Ancient Algorithms.
Sorting.
Graph Algorithms.
Primality Testing.
Solution of Linear Equations.
Newton’s Method.
Linear Programming.
Eigenvalues and Eigenvectors.
MM Algorithms.
Data Mining.
The Fast Fourier Transform.
Monte Carlo Methods.
Appendix A. Mathematical Review.
Bibliography.
Index