写在前面的话——Introduction to Algorithms Third Edition

我近期在读 Introduction to Algorithms, Third Edition,英文版。已经大致学习了一遍,现在计划更细致读第二遍并做笔记总结。这个系列笔记将会完整呈现我个人的所想所思,更重要的是我希望能够吸引更多的人进来讨论,共同成长。

如有错误,欢迎指出与讨论。

by Zhu Meng

E-mail:zhumeng1989(at)gmail.com

源代码托管GitHubGitCafe 欢迎合作。

笔记内容包括:章节总结、所思所想(结合算法发展)、课后习题讨论。力求简约,相信完美的东西一定是简约的。

进度表:

题目内容进度
写在前面的话计划,资料,目标2012.9.8 完成
伪代码排版包 clrscode3eclrscode3e 安装使用2012.9.8 完成
2. Getting StartedInsertion-Sort, Merge-Sort
Analyzing algorithms, Loop invariant
2012.9.8 完成
2. Exercises and Problems2.2-2, 2.2-3, 2.3-2, 2.3-5
2.3-6, 2.3-7, 2-1, 2-2, 2-3, 2-4
2012.9.11 完成
3. Growth of Functions概念2012.9.12 完成
4. Divide-and-ConquerDivide-and-Conquer, Maximum-Subarray
Strassen's Matrix Multiplication, Recurrences
2012.9.15 完成
4. Exercises and Problems4.1-4, 4.1-5, 4.2-7, 4.5-1, 4.5-2
4.5-3, 4.5-4, 4.5-5, 4-4, 4-5, 4-6
2012.9.18 完成
C. Counting and ProbabilityCounting and Probability2012.9.24 完成
5. Probabilistic Analysis and Randomized AlgorithmsProbabilistic Analysis
Randomized Algorithms, Uses
2012.9.25 完成
5. Exercises and Problems5.1-3, 5.2-1, 5.2-2, 5.2-4, 5.2-5
5.3-2, 5.3-3, 5.3-4, 5.3-5, 5.3-7
2012.9.26 完成

有价值的参考:

  1. Introduction to Algorithms, Third Edition 官方网站,包括勘误表,部分习题解答(合集)。
  2. MIT公开课网址包括课程视频,作业以及考试测验,不过是2005年的课程,所以用的是第二版。所有资料从 官网 Download Course Materials 下载。
  3. introduction-to-algorithms-notes,一个比较不错的学习记录,有笔记以及源代码。作者提到的参考 Tanky Woo 和 timebug 均主要使用中文第二版总结。
  4. songyy 博客园个人参考答案
注意:
这个系列的目标是精简总结,强调前后关联,感性吸收内化。不注重细枝末节,不大量重复原文。所以一定要结合原版阅读才行。
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 3
    评论
Introduction to Algorithms, Third Edition [精装] ~ Thomas H. Cormen (作者), Charles E. Leiserson (作者), Ronald L. Rivest (作者), Clifford Stein (作者) 出版社: The MIT Press; 3 (2009年9月30日) 精装: 1312页 正文语种: 英语 ISBN: 0262033844 条形码: 9780262033848 产品尺寸及重量: 23.1 x 20.6 x 5.3 cm ; 2.2 Kg ASIN: 0262033844 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.
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值