Introduction to Algorithms, 3rd Edition

出版者:The MIT Press

作者:Thomas H. Cormen

页数:1312

出版时间:2009-7-31

价格: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. 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.

作者简介

Thomas H.Cormen

达特茅斯学院计算机科学系副教授

Charles E.Leiserson

麻省理工学院计算机科学与电气工程系教授

Ronald L.Rivest

麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授

Clifford Stein

哥伦比亚大学工业工程与运筹学副教授

读后感

我对《算法导论CLRS》的态度一直是有所保留的。虽然早在国内的时候，这本书一直被推崇为经典。但我那时就觉得它对算法的描述不好。一段费解的伪码，加上一大段费口舌的解释。我觉得本可以做得更好。 后来知道，这是典型的美国本科生用书，美国的本科教材，大抵很罗嗦，都是厚...  

记得小学时，有很长一段时间疯狂的迷霍金，四年级的寒假拿了一百块压岁钱去买了两本他的科普读物《时间简史》《果壳中的宇宙》，一本45一本42，虽说是科普读物且全书只有一个数学公式（E=MC²），当时仍然完全看不懂，只能看看画，但附赠书签里的一句话却让我印象深刻：阅读...  

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

描述算法的这种书翻译一旦有错误，或者意思表达不到位，看起来就很吃力了。 第一次看算法导论是看的中文版。我是从头开始看的，一直看到图算法结束。读的时候主要追求速度，不少地方看的不是很明白。然而有些地方我觉得是翻译的问题导致理解上的障碍。 china-pub 上有人指出...  

用户评价

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

对面试来说帮助很少

Excellent book!

明年实习结束再去看看普林的一二册…

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