出版社: The MIT Press
出版年: 2009-7-31
页数: 1312
定价: USD 94.00
装帧: Hardcover
ISBN: 9780262033848
内容简介 · · · · · ·
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study....
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition.
As of the third edition, this textbook is published exclusively by the MIT Press.
Introduction to Algorithms (3/e)的创作者
· · · · · ·
作者简介 · · · · · ·
Thomas H.Cormen
达特茅斯学院计算机科学系副教授
Charles E.Leiserson
麻省理工学院计算机科学与电气工程系教授
Ronald L.Rivest
麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授
Clifford Stein
哥伦比亚大学工业工程与运筹学副教授
喜欢读"Introduction to Algorithms (3/e)"的人也喜欢的电子书 · · · · · ·
喜欢读"Introduction to Algorithms (3/e)"的人也喜欢 · · · · · ·
Introduction to Algorithms (3/e)的书评 · · · · · · ( 全部 100 条 )
论坛 · · · · · ·
哪里有下这本书课后习题答案? | 来自带上自己的太阳 | 1 回应 | 2021-03-29 23:10:57 |
第3版中文版 | 来自何艳 | 2012-12-13 14:30:51 | |
ppurl有下载了 | 来自继续发育 | 2010-11-30 17:31:26 | |
啥时候出影印版? | 来自evangel | 5 回应 | 2010-11-19 23:32:03 |
第三版了 | 来自corpsefire | 4 回应 | 2009-10-18 01:43:22 |
这本书的其他版本 · · · · · · ( 全部23 )
-
机械工业出版社 (2006)9.4分 4919人读过
-
机械工业出版社 (2012)9.3分 1065人读过
-
高等教育出版社 (2002)9.5分 960人读过
-
The MIT Press (2001)9.3分 528人读过
在哪儿借这本书 · · · · · ·
以下书单推荐 · · · · · · ( 全部 )
- 程序员最应该读的图书(原版) (hongqn)
- IT十年经典书籍 (wilde)
- 计算机科学经典著作 (白骨蔓草)
- Dr. Dobb's Essential Books on Algorithms and Data Structures (lyb)
- CSDN论坛频道和博客频道后面的那个频道 (架构师)
谁读这本书? · · · · · ·
二手市场
· · · · · ·
订阅关于Introduction to Algorithms (3/e)的评论:
feed: rss 2.0
0 有用 ssqqssqq12 2011-04-09 12:32:59
质飞跃
0 有用 友好的境外势力 2012-12-10 02:27:37
(心
0 有用 cosy 2017-10-06 13:21:53
非常优秀的教材,可以帮助编程零基础的人打下坚实的理论基础。证明严谨,伪代码易懂(for each i这样的句子比C语言里泛滥的i++,++i清晰多了),讲解部分也十分详细。但是需要注意:本书仅仅侧重理论部分,如果需要学习编程,一定需要结合实战操作的书籍配套使用才有好效果。
0 有用 confabulator 2011-07-21 15:29:42
没看完。
0 有用 unlockingman 2013-12-17 21:51:17
07, 08年买的第二版, 后来又入了第三版, 终于慢慢读明白了. 只要主义真, 铁杵磨成针....
0 有用 freezedried 2024-03-21 23:06:18 加拿大
以前只是单纯学算法怎么写的时候觉得这本书又臭又长,开始学证明之后发现这本书写得还是挺好的…
0 有用 板蓝根 2024-03-01 21:07:23 法国
我有罪 看了三遍还不懂
0 有用 船山遗风 2023-11-18 23:14:17 浙江
研究生导师推荐,算法学习,动态规划。
0 有用 Ahacad 2023-11-04 15:47:53 美国
据说没有人读完的书:CLRS
0 有用 周之余 2023-10-07 17:50:39 上海
老师指定的教材;期末备考的时候做了一部分例题,感觉质量比教学部分高