An Introduction to the Analysis of Algorithms 在線電子書 圖書標籤: 計算機科學 算法分析 算法 Algorithms algorithm-analysis algorithm 計算機 英文原版
發表於2024-12-25
An Introduction to the Analysis of Algorithms 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024
5星改成瞭4星……
評分個人認為講的太理論瞭一點
評分5星改成瞭4星……
評分個人認為講的太理論瞭一點
評分5星改成瞭4星……
Robed Sedgewick擁有斯坦福大學博士學位(導師為Donald E. Knuth),昔林斯頓大學計算機科學係教授,Adobe Systems公司董事,曾是XeroxPARC的研究人員,還曾就職於美國國防部防禦分析研究所以及INRIA。
Philippec Flajoletc 是INRIA的高級研究主任,在EcolePolytechnique和普林斯頓大學任教, 並在斯坦福大學、智利大學和弗吉尼亞技術大學擁有訪問席位、他還是法國科學院的通信會員.
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
1977 年法国人 Philippe Flajolet 发表了一篇评估计算机展开算术表达式平均所需寄存器数量的论文 [1]。同年,普林斯顿的 Rebert Sedgewick 向 SIAM 投递了一篇讨论奇偶归并排序的文章 [2],其中给出了数据在排序过程中平均交换次数的简洁表达式。Sedgewick 通过渐进分析获得的...
評分1977 年法国人 Philippe Flajolet 发表了一篇评估计算机展开算术表达式平均所需寄存器数量的论文 [1]。同年,普林斯顿的 Rebert Sedgewick 向 SIAM 投递了一篇讨论奇偶归并排序的文章 [2],其中给出了数据在排序过程中平均交换次数的简洁表达式。Sedgewick 通过渐进分析获得的...
評分怎么没人说明一下这本书是一本偏向数学的书?我完全看不懂啊。里面跟代码完全没有任何关系,也没有算法的分析啊,只有数学公式啊。如果我早知道必然是不买的啊。 我一直以为这本书是一本如何分析算法的书,结果打开来看完全是分析算法时间复杂度的数学书。看作者是著名的写C数...
評分1977 年法国人 Philippe Flajolet 发表了一篇评估计算机展开算术表达式平均所需寄存器数量的论文 [1]。同年,普林斯顿的 Rebert Sedgewick 向 SIAM 投递了一篇讨论奇偶归并排序的文章 [2],其中给出了数据在排序过程中平均交换次数的简洁表达式。Sedgewick 通过渐进分析获得的...
評分1977 年法国人 Philippe Flajolet 发表了一篇评估计算机展开算术表达式平均所需寄存器数量的论文 [1]。同年,普林斯顿的 Rebert Sedgewick 向 SIAM 投递了一篇讨论奇偶归并排序的文章 [2],其中给出了数据在排序过程中平均交换次数的简洁表达式。Sedgewick 通过渐进分析获得的...
An Introduction to the Analysis of Algorithms 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024