具体描述
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.
用户评价
##非常优秀的教材，可以帮助编程零基础的人打下坚实的理论基础。证明严谨，伪代码易懂（for each i这样的句子比C语言里泛滥的i++,++i清晰多了），讲解部分也十分详细。但是需要注意：本书仅仅侧重理论部分，如果需要学习编程，一定需要结合实战操作的书籍配套使用才有好效果。
评分##刚开始看，觉得讲得很清楚。
评分##没看完。
评分##（心
评分##在stanford上了cs161这本是必读书目
评分##没看完。
评分##07, 08年买的第二版, 后来又入了第三版, 终于慢慢读明白了. 只要主义真, 铁杵磨成针....
评分##终于算是粗浅地看完了一遍
评分##算法导论的原版。大美利坚cs专业学生人手一册
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.teaonline.club All Rights Reserved. 图书大百科 版权所有