具體描述
Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College.
Charles E. Leiserson is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT.
Ronald L. Rivest is Institute Professor at MIT.
Clifford Stein is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.
New for the fourth edition
• New chapters on matchings in bipartite graphs, online algorithms, and machine learning
• New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
• 140 new exercises and 22 new problems
• Reader feedback–informed improvements to old problems
• Clearer, more personal, and gender-neutral writing style
• Color added to improve visual presentation
• Notes, bibliography, and index updated to reflect developments in the field
• Website with new supplementary material
用戶評價
##我自己花瞭3個月差4天的業餘時間讀瞭大約575頁，最後一個章節 selected topics 略過瞭，後麵的 appendix 也略過瞭，前麵二十六章略過瞭幾個小節，個人覺得無傷大雅的地方。 體會就是，確實不錯。比較注重算法證明和邏輯推導，某種程度上更像是在讀數學教材，但是所需要的數學知...
評分 評分##之前嘗試自學這本書，很失敗。。太難。。 後來到美國上學開始係統的跟著老師走這本書。基本看完瞭，也寫寫評論。 首先我肯定是力薦的，經典。 然後幾個問題： 1. 初學者，自學? 第一次看之前，我大概過瞭一遍MIT公開課，看瞭Data Structure and Algorithms in C++ (大概這個名...
評分##可以查看該地址來查看第三版習題答案，雖然全書和答案都是用僞代碼，但我感覺，僞代碼就已經很好的解決問題瞭。 [https://walkccc.github.io/CLRS/Chap02/2.2/] 該算法導論可能更多的偏嚮於思維，而不是實戰。工程上的應用還是要結閤其他方方麵麵來處理。。 如果覺得習題不夠，...
評分 評分 評分##如果你覺得TAOCP太厚瞭，那就讀這本。雖然比起很多計算機算法書籍，這本書也是很厚的，它的確值得這麼厚。 讀瞭這本書，基本上就不需要再讀其他的算法教科書瞭。
評分 評分相關圖書
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.tinynews.org All Rights Reserved. 静思书屋 版权所有