Thomas H.Cormen
达特茅斯学院计算机科学系副教授
Charles E.Leiserson
麻省理工学院计算机科学与电气工程系教授
Ronald L.Rivest
麻省理工学院计算机科学系Andrew与Erna Viterbi具名教授
Clifford Stein
哥伦比亚大学工业工程与运筹学副教授
发表于2024-05-14
Introduction to Algorithms, 3rd Edition 2024 pdf epub mobi 电子书
这本书和国内学者编写的算法教材有些差别。 首先,就像其他国外教材一样,该书讲解的很细致,习惯国内教材的读者可能觉得写得有点罗嗦,不过个人感觉很适合自学。 其次,每一章节最后都附有延伸阅读的建议,对于深入学习很有帮助。 最后,本书对算法的讲解使用的是伪码,不...
评分大家可以上MIT的OCW站看看 http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm 另外还有第3版的笔记和PPT http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-006Spring-2008/CourseHome/in...
评分之前尝试自学这本书,很失败。。太难。。 后来到美国上学开始系统的跟着老师走这本书。基本看完了,也写写评论。 首先我肯定是力荐的,经典。 然后几个问题: 1. 初学者,自学? 第一次看之前,我大概过了一遍MIT公开课,看了Data Structure and Algorithms in C++ (大概这个名...
评分就内容而言,是一本非常全面和严谨的教材;几乎所有的重要的算法,都能在这部书中找到;并且对算法的实现和性能都有清楚的解释。 但是,这只是一本“授之以鱼“,而不是”授之以渔”的书。如果过上一段时间,让你不看书写出某个算法或者证明某个结论,我想可能会有不少人,总...
评分推荐殿堂级的算法工具书《算法导论》,讲解了常见的算法和数据结构,分类细致且论证通俗;内容包含排序和递归、广度优先与生成树、线性规划以及诸多穷尽智力而不能读懂的算法。文字深入浅出且没有学术教条,例题相当具有范式意义;再也不必为了一个算法的逻辑意义和代码实现去...
图书标签: 算法 Algorithms 计算机 计算机科学 编程 algorithm programming 经典
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.
You can program for ten years to become a top programmer. Or you can program for two years and take algorithms lessons.
评分读了个大概
评分本科时候的教材 教授的俄罗斯口音基本听不懂 只有考着这本书撑了一学期 并且在期末考试拿了A
评分太长了。看过之后也动不了手。不适合自学,还是当字典吧
评分读了个大概
Introduction to Algorithms, 3rd Edition 2024 pdf epub mobi 电子书