The Algorithm Design Manual. Third Edition
Год издания: 2020
Автор: Steven S. Skiena
Издательство: Springer
ISBN: ISBN 978-3-030-54256-6
Язык: Английский
Формат: PDF
Качество: Издательский макет или текст (eBook)
Интерактивное оглавление: Да
Количество страниц: 800
Описание:
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.
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
dumpz.ws
Год издания: 2020
Автор: Steven S. Skiena
Издательство: Springer
ISBN: ISBN 978-3-030-54256-6
Язык: Английский
Формат: PDF
Качество: Издательский макет или текст (eBook)
Интерактивное оглавление: Да
Количество страниц: 800
Описание:
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.
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
Скрытое содержимое могут видеть только пользователи групп(ы): Premium, Местный, Свои