出版社: McGraw-Hill Science/Engineering/Math
出版年: 2003-12-16
页数: 1056
定价: $ 192.67
装帧: Hardcover
ISBN: 9780072970548
内容简介 · · · · · ·
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Intro...
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
Introduction to Algorithms的创作者
· · · · · ·
作者简介 · · · · · ·
Thomas H.Cormen
达特茅斯学院计算机科学系副教授
Charles E.Leiserson
麻省理工学院计算机科学与电气工程系教授
Ronald L.Rivest
麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授
Clifford Stein
哥伦比亚大学工业工程与运筹学副教授
喜欢读"Introduction to Algorithms"的人也喜欢 · · · · · ·
- 设计模式 9.0
Introduction to Algorithms的书评 · · · · · · ( 全部 99 条 )
> 更多书评 99篇
论坛 · · · · · ·
在这本书的论坛里发言这本书的其他版本 · · · · · · ( 全部23 )
-
机械工业出版社 (2006)9.3分 4916人读过
-
机械工业出版社 (2012)9.3分 1057人读过
-
高等教育出版社 (2002)9.5分 960人读过
-
The MIT Press (2009)9.5分 503人读过
以下书单推荐 · · · · · · ( 全部 )
- Rich Hickey's Clojure Bookshelf (Whyme Lyu)
- 开卷有益 经典必读 之 计算机科学 (passiondaisy)
- 算法~ (LHF)
谁读这本书? · · · · · ·
二手市场
· · · · · ·
- 在豆瓣转让 有11人想读,手里有一本闲着?
订阅关于Introduction to Algorithms的评论:
feed: rss 2.0
还没人写过短评呢
还没人写过短评呢