Новое в третьем издании
• Расширенный набор рандомизированных алгоритмов, хеширования, алгоритмов «разделяй и властвуй», аппроксимации и квантовых вычислений.
• Онлайн-поддержка для преподавателей, включающая слайды и видеоуроки.
• Полноцветные иллюстрации и код, наглядно разъясняющие сложные концепции
• Новые «истории из жизни», рассказывающие об опыте работы с реальными приложениями.
• Более 100 новых задач, включая задачи по программированию от LeetCode и Hackerrank.
• Актуальные ссылки к лучшим реализациям на языках C, C++ и Java.
В оригинале
«Skiena S.S. The Algorithm Design Manual. Third Edition». — (Texts in Computer Science). — 2020 (October 7, 2021)
Unique, handy reference package with a practical, hands-on appeal to a wide audience. This classic bestseller has been fully updated, and enhanced with new and expanded material on hashing and randomized algorithms, divide and conquer algorithms, and dealing with hard problems (including quantum algorithms). Contains a highly unique catalog of the 75 most important algorithmic problems.
This newly expanded and updated third edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficiency. It serves as the primary textbook of choice for algorithm design courses and interview self-study, while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.
Many professional programmers are not well prepared to tackle algorithm design problems. This is a pity, because the techniques of algorithm design form one of the core practical technologies of computer science. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals.
The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Practical Algorithm Design, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, the Hitchhiker's Guide to Algorithms, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations, and an extensive bibliography.
NEW to the third edition:
New and expanded coverage of randomized algorithms, hashing, divide and conquer, approximation algorithms, and quantum computing
Provides full online support for lecturers, including an improved website component with lecture slides and videos
Full color illustrations and code instantly clarify difficult concepts
Includes several new "war stories" relating experiences from real-world applications
Over 100 new problems, including programming-challenge problems from LeetCode and Hackerrank.
Provides up-to-date links leading to the best implementations available in C, C++, and Java
Additional Learning Tools:
Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them
Exercises include "job interview problems" from major software companies
Highlighted "take home lessons" emphasize essential concepts
The "no theorem-proof" style provides a uniquely accessible and intuitive approach to a challenging subject
Many algorithms are presented with actual code (written in C)
Provides comprehensive references to both survey articles and the primary literature
Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this substantially enhanced third edition of The Algorithm Design Manual is an essential learning tool for students and professionals needed a solid grounding in algorithms.
Introduction to Algorithm Design
Algorithm Analysis
Data Structures
Sorting
Divide and Conquer
Hashing and Randomized Algorithms
Graph Traversal
Weighted Graph Algorithms
Combinatorial Search
Dynamic Programming
NP-Completeness
Dealing with Hard Problems
How to Design Algorithms
A Catalog of Algorithmic Problems
Data Structures
Numerical Problems
Combinatorial Problems
Graph Problems: Polynomial Time
Graph Problems: NP-Hard
Computational Geometry
Set and String Problems
Algorithmic Resources
Стивен Соль Скиена — ученый-компьютерщик и заслуженный профессор компьютерных наук в Университете Стоуни-Брук, директор Института искусственного интеллекта в Стоуни-Брук. Автор нескольких популярных книг в области алгоритмов, программирования и математики. Его книга Алгоритмы. Руководство по разработке (The Algorithm Design Manual) широко используется в качестве учебника по алгоритмам и для подготовки к собеседованию в технической индустрии. В 2001 году Скиена была награждена премией IEEE Computer Science and Engineering для студентов-преподавателей «За выдающийся вклад в высшее образование в области алгоритмов и дискретной математики, а также за влиятельные учебники и программное обеспечение»
На ресурсе клуба имеется одноимённый релиз в ином формате
Стивен Скиена | Алгоритмы. Руководство по разработке. 3-е изд (2022) [PDF] 
(Голосов: 
