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,...
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
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. Professor Skiena is also the author of the popular Springer texts, The Data Science Design Manual and Programming Challenges: The Programming Contest Training Manual.
作者简介
· · · · · ·
Dr. Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University, with research interests in data science, natural language processing, and algorithms. He was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award “for outstanding contributions to undergraduate education ...and for influential textbooks and software....
Dr. Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University, with research interests in data science, natural language processing, and algorithms. He was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award “for outstanding contributions to undergraduate education ...and for influential textbooks and software.”
Typical computer science students study the basic sorting algorithms at least three times before they graduate: first in introductory programming, then in data structures, and finally in their algorithms course. (查看原文)
When you have morethan 100 items to sort, it is important to use an O(nlgn)-time algorithm like heapsort, quicksort, or mergesort.
... Once you get past (say) 5,000,000 items, it is important to start thinking about external-memory sorting algorithms that minimize disk access. (查看原文)
Texts in Computer Science(共22册),
这套丛书还有
《Computer Vision》《Algorithms on Trees and Graphs: With Python Code》《Software Reliability Methods》《Computational Methods for Deep Learning: Theoretic, Practice and Applications》《An Integrated Approach to Software Engineering (Texts in Computer Science)》
等
。
Compared with CLRS: - Both books are well written and way above the average. - "Almost" as great as the classic CLRS. - Not so textbook like which is both good and bad: - Has clearer statements about goals and abstractions of algorithms and data struct...
(展开)
看着看着时而就觉得不明白了 看到amazon上有人说 This book isn't always the easiest to understand.. . Consider the explanation of Djikstra's Algorithm on p. 206 of the 2nd ed: ... 我才放下心来. 他就是没讲明白么,真是的!
(展开)
0 有用 阅微草堂 2021-11-24 15:28:24
一个想去谷歌却去了亚马逊的人说自己专心研究这本书
0 有用 Creasy 2022-10-11 10:31:26 美国
Read it for the 4th time
0 有用 来蝠 2025-09-18 23:52:10 上海
研究生课的教材。宝藏书啊!常读常新