Introduction to Algorithms (4/e)

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

书籍简介:

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

作者简介:

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.

书友短评:

@ Melo 2022年4月《算法导论》发布了第四版,官方配套有python源代码实现书中的算法。还有官方教师手册(第三版),含有每章后面的答案! (私信我,给你发《算法导论》第四版英文电子书,还有配套的python源码 和 每章答案!)

书籍目录

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

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

    评论 抢沙发

    评论前必须登录!

     

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

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