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
發表於2024-12-22
An Introduction to the Analysis of Algorithms 2024 pdf epub mobi 電子書 下載
1977 年法國人 Philippe Flajolet 發錶瞭一篇評估計算機展開算術錶達式平均所需寄存器數量的論文 [1]。同年,普林斯頓的 Rebert Sedgewick 嚮 SIAM 投遞瞭一篇討論奇偶歸並排序的文章 [2],其中給齣瞭數據在排序過程中平均交換次數的簡潔錶達式。Sedgewick 通過漸進分析獲得的...
評分這本書非常適閤在離散數學裏麵當補充教材(至少當前我們學校的離散數學並不涉及這些內容), 如果說本科有"計算機科學"這個專業的話, 那麼我覺得這本書裏的很多內容都應該列為必修內容, 非常遺憾沒有早點看到這本書.
評分怎麼沒人說明一下這本書是一本偏嚮數學的書?我完全看不懂啊。裏麵跟代碼完全沒有任何關係,也沒有算法的分析啊,隻有數學公式啊。如果我早知道必然是不買的啊。 我一直以為這本書是一本如何分析算法的書,結果打開來看完全是分析算法時間復雜度的數學書。看作者是著名的寫C數...
評分怎麼沒人說明一下這本書是一本偏嚮數學的書?我完全看不懂啊。裏麵跟代碼完全沒有任何關係,也沒有算法的分析啊,隻有數學公式啊。如果我早知道必然是不買的啊。 我一直以為這本書是一本如何分析算法的書,結果打開來看完全是分析算法時間復雜度的數學書。看作者是著名的寫C數...
評分1977 年法國人 Philippe Flajolet 發錶瞭一篇評估計算機展開算術錶達式平均所需寄存器數量的論文 [1]。同年,普林斯頓的 Rebert Sedgewick 嚮 SIAM 投遞瞭一篇討論奇偶歸並排序的文章 [2],其中給齣瞭數據在排序過程中平均交換次數的簡潔錶達式。Sedgewick 通過漸進分析獲得的...
圖書標籤: 計算機科學 算法分析 算法 Algorithms algorithm-analysis algorithm 計算機 英文原版
5星改成瞭4星……
評分5星改成瞭4星……
評分曾經的教材,我考得還可以;每當我搗鼓歐拉工程的題目(https://github.com/greatabel/puzzle_I_cracked/tree/master/3ProjectEuler),涉及到實現個特定結構或者排列組閤時間空間復雜度時候,就順便對應復習章節,畢竟現實生活中30%的編程+70%管理,編程主要也是架構和保密的算法小模塊,再就是審核代碼,工作量不足啊,看看英文原版復習下算法和英語
評分個人認為講的太理論瞭一點
評分5星改成瞭4星……
An Introduction to the Analysis of Algorithms 2024 pdf epub mobi 電子書 下載