开始学习MIT课程6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

最新推荐文章于 2023-10-10 11:27:32 发布

原创最新推荐文章于 2023-10-10 11:27:32 发布 · 2.1k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#homework #sorting #caching #parallel #methods #features

算法学习专栏收录该内容

2 篇文章

订阅专栏

本课程教授高效算法的设计与分析技巧，重点介绍实用的方法。内容涵盖排序、搜索树、堆、哈希、分治法、动态规划等核心主题。此外还涉及图算法、最短路径、网络流等领域。

6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Cover of textbook, Introduction to Algorithms.

Cover of 6.046J textbook, Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest, and Stein. (Image courtesy of MIT Press.)

Highlights of this Course

This course features a complete set of lecture notes and videos in the lecture notes section. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.

Course Description

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).