Algorithms: Design and Analysis, Part 1

Archived

课程

英语

30 时

(1 评论1)

你无法访问存档的讲座

来源

来自www.coursera.org

状况

自定进度
免费获取
免费证书

更多信息

6 序列
等级介绍

你无法访问存档的讲座

Their employees are learning daily with

Learn more

课程详情

教学大纲

Week 1: Introduction. Asymptotic analysis including big-oh notation. Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair.

Week 2: Running time analysis of divide-and-conquer algorithms. The master method. Introduction to randomized algorithms, with a probability review. QuickSort.

Week 3: More on randomized algorithms and probability. Computing the median in linear time. A randomized algorithm for the minimum graph cut problem.

Week 4: Graph primitives. Depth- and breadth-first search. Connected components in undirected graphs. Topological sort in directed acyclic graphs. Strongly connected components in directed graphs.

Week 5: Dijkstra's shortest-path algorithm. Introduction to data structures. Heaps and applications.

Week 6: Further data structures. Hash tables and applications. Balanced binary search trees.