算法导论Introduction to Algorithms |
|
课程网址: | http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc... |
主讲教师: | Charles Leiserson; Erik Demaine |
开课单位: | 麻省理工学院 |
开课时间: | 2005-01-01 |
课程语种: | 英语 |
中文简介: | 本课程教授设计和分析有效算法的技术, 强调在实践中有用的方法。所涉及的主题包括: 排序;搜索树, 堆, 和哈希;分而治之; 分而治之; 分而治之动态规划;摊销分析;图算法;最短路径;网络流;计算几何;数字理论算法;多项式和矩阵计算;缓存;和并行计算。该课程也是新加坡-麻省理工学院联盟 (sma) 方案的一部分, 作为课程编号 sma 5503 (算法分析和设计)。 |
课程简介: | This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms). |
关 键 词: | 涵盖; 分析技术; 课程编号 |
课程来源: | 麻省理工学院公开课 |
最后编审: | 2020-11-27:yumf |
阅读次数: | 84 |