具体描述
Thomas H.Cormen
达特茅斯学院计算机科学系副教授
Charles E.Leiserson
麻省理工学院计算机科学与电气工程系教授
Ronald L.Rivest
麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授
Clifford Stein
哥伦比亚大学工业工程与运筹学副教授
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.
用户评价
##（心
评分 评分虽然伪代码写得很恶心，但是永恒经典，白天可避孕，晚上可防身。另外，中文翻译一定是体育老师。
评分 评分##终于算是粗浅地看完了一遍
评分##可以查看该地址来查看第三版习题答案，虽然全书和答案都是用伪代码，但我感觉，伪代码就已经很好的解决问题了。 [https://walkccc.github.io/CLRS/Chap02/2.2/] 该算法导论可能更多的偏向于思维，而不是实战。工程上的应用还是要结合其他方方面面来处理。。 如果觉得习题不够，...
评分相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.coffeedeals.club All Rights Reserved. 静流书站 版权所有