Introduction to Algorithms, 3rd Edition

Thomas H.Cormen达特茅斯学院计算机科学系副教授Charles E.Leiserson麻省理工学院计算机科学与电气工程系教授Ronald L.Rivest麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授Clifford Stein哥伦比亚大学工业工程与运筹学副教授

出版者:The MIT Press

作者:Thomas H. Cormen

页数:1312

出版时间:2009-7-31

价格:USD 94.00

装帧:Hardcover

isbn号码:9780262033848

图书标签:算法Algorithms计算机计算机科学编程algorithmprogramming经典

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.

读后感

在所有的算法的书籍中，若论经典，这本书当之无愧。我们学校ACM代表队去年获得了亚洲赛冠军，而他们每人都有这么一本。本人也心向往之。书的内容覆盖的算法非常全面，单从书的厚度就可见了。而英文译作的一个普遍优点就是语言详尽，不像国内有些书说的模模糊糊，当然这并不是说...

这本书和国内学者编写的算法教材有些差别。 首先，就像其他国外教材一样，该书讲解的很细致，习惯国内教材的读者可能觉得写得有点罗嗦，不过个人感觉很适合自学。 其次，每一章节最后都附有延伸阅读的建议，对于深入学习很有帮助。 最后，本书对算法的讲解使用的是伪码，不...  

去年，我曾借阅过这本《算法导论》，读《算法导论》时常有这种想法：当读到一章比较难懂的部分，如大段的数学证明，或者题目很难做，这个时候就会没耐心去读，或者草草带过，不求甚解，有时干脆跳过不读～但又心存愧意，觉得碰到晦涩难懂的就不去钻研而选择逃避，实在不该。于...  

在所有的算法的书籍中，若论经典，这本书当之无愧。我们学校ACM代表队去年获得了亚洲赛冠军，而他们每人都有这么一本。本人也心向往之。书的内容覆盖的算法非常全面，单从书的厚度就可见了。而英文译作的一个普遍优点就是语言详尽，不像国内有些书说的模模糊糊，当然这并不是说...

用户评价

Hopefully I could finish it this time :-)

07, 08年买的第二版, 后来又入了第三版, 终于慢慢读明白了. 只要主义真, 铁杵磨成针....

graphs are soooooo illuminating ~~~

php和JavaScript都不适合写算法，then i digest... i'm gonna pick up the good parts along the way instead of pure learning

graphs are soooooo illuminating ~~~