算法分析导论
An introduction to the analysis of algorithms
Robert Sedgewick、Philippe Flajolet · 初版 1995 年
3人推荐
6位读者提及
6次提及
本书全面介绍了用于算法数学分析的主要技术。作者不仅汲取了经典数学素材（包括离散数学、初等实分析和组合学），还融合了经典计算机科学内容（包括算法与数据结构）。他们侧重于“average-case”或“probabilistic”分析，同时也涵盖了“worst-case”或“complexity”分析所需的基础数学工具。涵盖主题包括recurrences、generating functions、asymptotics、trees、strings、maps以及……
Hacker News 上怎么说
正在加载完整评论……
也许可以看 Knuth 的《计算机程序设计艺术》（The Art of Computer Programming），以及 Sedgewick（Knuth 的学生）的《算法分析导论》（An Introduction to the Analysis of Algorithms）。还有 Ben-Ari 的《面向计算机科学的数理逻辑》（Mathematical Logic for Computer Science）以及 Pierce 的《软件基础》（Software Foundations）。
Perhaps Knuth's "The Art of Computer Programming" and Sedgewick's (Knuth's student) "An Introduction to the Analysis of Algorithms". Also, Ben-Ari's "Mathematical Logic for Computer Science" and Pierce's "Software Foundations".
……一台机器作为输入规模的函数（这也是 Knuth 等人开创该领域的最初动力）。同样的作者（不过署名顺序是 Sedgewick 和 Flajolet！）还合著了一本叫《An Introduction to the Analysis of Algorithms》的书；课程网站在 https://aofa.cs.princeton.edu/home/，Coursera 上也有视频（https://www.coursera.org/learn/analysis-of-algorithms）——属于高等数学范畴，但没有……那么高深
…a machine as a function of the input size (which was the original motivation for Knuth etc to develop the field). The same authors (but ordered as Sedgewick and Flajolet!) also have a book called An Introduction to the Analysis of Algorithms; there's a course website at https://aofa.cs.princeton.edu/home/ and videos on Coursera (https://www.coursera.org/learn/analysis-of-algorithms) — it is advanced mathematics but less advanced than the…
……Sedgewick 的书/课程《Algorithms》[1]。如果想了解更深的内容和理论，可以看看 [2]，即 Cormen 和 Leiserson 那本极佳的《算法导论》（Introduction to Algorithms）。或者，相关理论在 Sedgewick 的另一本书《算法分析导论》（An Introduction to the Analysis of Algorithms）[3] 里也有涵盖。当然，远超这几本书的经典参考书当属 Knuth [4]，它适合计算机专业的严肃求学者，不太适合当作速查菜谱式的参考书。学完这些基础之后，还有一些书……
…Sedgewick's book/course, Algorithms [1]. For more depth and theory try [2], Cormen and Leiserson's excellent Introduction to Algorithms. Alternatively the theory is also covered by another book by Sedgewick, An Introduction to the Analysis of Algorithms [3]. A classic reference that goes far beyond these other books is of course Knuth [4], suitable for serious students of Computer Science less so as a book of recipes. After these basics, there are books…
……可以在网上淘到便宜的）；1) Kruse、Leung 和 Tondo 合著的《C 语言数据结构与程序设计》。2) Robert Sedgewick 著的《C 算法》（第 1-4 部分和第 5 部分共两卷套书）。3) Gregory Rawlins 著的《Compared to What? An Introduction to the Analysis of Algorithms》。4) Jeff Edmonds 著的《如何思考算法》（How to think about Algorithms）。5) Peter Brass 著的《高级数据结构》（Advanced Data Structures）。最后，深入研究一下 C++ STL 库背后的思想、概念和技术，看看……
…can be had for cheap online); 1) Data Structures and Program Design in C by Kruse, Leung and Tondo. 2) Algorithms in C (Parts1-4 and Part5 two-volume set) by Robert Sedgewick. 3) Compared to What? An Introduction to the Analysis of Algorithms by Gregory Rawlins. 4) How to think about Algorithms by Jeff Edmonds. 5) Advanced Data Structures by Peter Brass. Finally, study the ideas, concepts and techniques behind the C++ STL library to see…
……只有 trie（也叫前缀树）和后缀树（suffix tree）。根本就没有后缀 trie（suffix trie）这种说法。冒着被说成狂妄自大的风险我得说一句：谁去告诉 Robert Sedgewick 一声吧。他在刚出版的最新著作《算法分析导论第二版》（An Introduction to the Analysis of Algorithms, Second Edition）里就用了这个术语。如果因为我匆匆扫了眼你的帖子而误解了你，那先道个歉，但 Kevin 绝对不是凭空瞎编这个词的。
…that there is trie (which is also called prefix tree) and suffix tree. There is no suffix trie. At the risk of being snotty: someone should tell Robert Sedgwick. He uses the term in his newest book, "An Introduction to the Analysis of Algorithms, Second Edition," which just came out. Sorry if I haven't been fair to your post due to a quick reading but Kevin isn't making the term up.
一本类似《代码大全》（Code Complete）或者《算法分析导论》（An Introduction to the Analysis of Algorithms）的书
a book like "Code complete" or "An Introduction to the Analysis of Algorithms"