Introduction to Algorithms (3/e)

书名:Introduction to Algorithms (3/e)
作者:ThomasH.Cormen/CharlesE.Leiserson/RonaldL.Rivest/CliffordStein
译者:
ISBN:9780262033848
出版社:TheMITPress
出版时间:2009-7-31
格式:epub/mobi/azw3/pdf
页数:1312
豆瓣评分: 9.5

书籍简介:

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

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

书友短评:

@ unlockingman 07, 08年买的第二版, 后来又入了第三版, 终于慢慢读明白了. 只要主义真, 铁杵磨成针…. @ 豆花鱼 终于算是粗浅地看完了一遍 @ Anonymous 对面试来说帮助很少 @ 拜大五郎 总之很有收获 @ 4 刚开始看,觉得讲得很清楚。 @ Ahacad 据说没有人读完的书:CLRS @ 周之余 老师指定的教材;期末备考的时候做了一部分例题,感觉质量比教学部分高 @ Kaffeesucht 找不到德语版的就暂时标记这本吧,这学期最头疼的课 @ 普罗米修无私 🐮🍺,还真有。 @ 禁断症状中 神中神,题目质量很高

书籍目录

  • 动态规划算法的设计可以分为如下四个步骤:1 描述最优解的结构。2 递归定义最优解的值。3 按自底向上的方式计算最优解的值。4 由计算出的结果构造一个最优解。
    —— 引自第192页
  • 在最好的情况下,k=0,因此s'=s+q,并且立刻能得出偏移s+1,s+2,s+3,…s+q-1。
    —— 引自第589页
  • 添加微信公众号:好书天下获取

    添加微信公众号:“好书天下”获取书籍好书天下 » Introduction to Algorithms (3/e)
    分享到: 更多 (0)

    评论 抢沙发

    评论前必须登录!

     

    添加微信公众号:“好书天下”获取书籍

    好书天下