# 分治法、排序和搜索、随机算法

## Divide and Conquer, Sorting and Searching, and Randomized Algorithms

2056 次查看

Coursera
• 完成时间大约为 22 个小时
• 中级
• 英语

### 你将学到什么

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

### 课程大纲

Week 1
Introduction; "big-oh" notation and asymptotic analysis.
13 个视频 （总计 130 分钟）, 3 个阅读材料, 2 个测验

Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
11 个视频 （总计 170 分钟）, 2 个阅读材料, 2 个测验

Week 3
The QuickSort algorithm and its analysis; probability review.
9 个视频 （总计 156 分钟）, 1 个阅读材料, 2 个测验

Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.

Apple 广告
##### 声明：MOOC中国十分重视知识产权问题，我们发布之课程均源自下列机构，版权均归其所有，本站仅作报道收录并尊重其著作权益。感谢他们对MOOC事业做出的贡献！
• Coursera
• edX
• OpenLearning
• FutureLearn
• iversity
• Udacity
• NovoEd
• Canvas
• Open2Study
• ewant
• FUN
• IOC-Athlete-MOOC
• World-Science-U
• CourseSites
• opencourseworld
• ShareCourse
• gacco
• JANUX
• openhpi
• Stanford-Open-Edx
• 网易云课堂
• 中国大学MOOC
• 学堂在线
• 顶你学堂
• 华文慕课
• 好大学在线CnMooc