作者：RobertSedgewick/PhilippeFlajolet
出版社：Addison-WesleyProfessional
出版年：2013-1-28
页数：604
定价：USD79.99
装帧：Hardcover
ISBN：9780321905758
内容简介 ······
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure. Improvements and additions in this new edition include * Upgraded figures and code * An all-new chapter introducing analytic combinatorics * Simplified derivations via analytic combinatorics throughout The book's thorough, self-contained coverage will help readers appreciate the field's challenges, prepare them for advanced results-covered in their monograph Analytic Combinatorics and in Donald Knuth's The Art of Computer Programming books-and provide the background they need to keep abreast of new research. "[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways." -From the Foreword by Donald E. Knuth
作者简介 ······
Robed Sedgewick拥有斯坦福大学博士学位(导师为Donald E. Knuth)，昔林斯顿大学计算机科学系教授，Adobe Systems公司董事，曾是XeroxPARC的研究人员，还曾就职于美国国防部防御分析研究所以及INRIA。
Philippec Flajoletc 是INRIA的高级研究主任,在EcolePolytechnique和普林斯顿大学任教, 并在斯坦福大学、智利大学和弗吉尼亚技术大学拥有访问席位、他还是法国科学院的通信会员.
评论 ······
曾经的教材，我考得还可以；每当我捣鼓欧拉工程的题目（https://github.com/greatabel/puzzle_I_cracked/tree/master/3ProjectEuler），涉及到实现个特定结构或者排列组合时间空间复杂度时候，就顺便对应复习章节，毕竟现实生活中30%的编程+70%管理，编程主要也是架构和保密的算法小模块，再就是审核代码，工作量不足啊，看看英文原版复习下算法和…
个人认为讲的太理论了一点
5星改成了4星……
个人认为讲的太理论了一点
暂无评论内容