你将学到什么
Algorithms
Randomized Algorithm
Sorting Algorithm
Divide And Conquer Algorithms
课程概况
The primary topics in this part of the specialization are: asymptotic (“Big-oh”) notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
课程大纲
周1
完成时间为 3 小时
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 个视频 （总计 130 分钟）, 3 个阅读材料, 2 个测验
周2
完成时间为 3 小时
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 个视频 （总计 170 分钟）, 2 个阅读材料, 2 个测验
周3
完成时间为 3 小时
Week 3
The QuickSort algorithm and its analysis; probability review.
9 个视频 （总计 156 分钟）, 1 个阅读材料, 2 个测验
周4
完成时间为 4 小时
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
