Divide和Conquer、排序和搜索以及随机算法

Divide and Conquer, Sorting and Searching, and Randomized 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).

斯坦福大学

Coursera

计算机

普通(中级)

21 小时

课程概况

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

你将学到什么

Algorithms

Randomized Algorithm

Sorting Algorithm

Divide And Conquer Algorithms

课程大纲

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

声明:MOOC中国发布之课程均源自下列机构,版权均归他们所有。本站仅作报道收录并尊重其著作权益,感谢他们对MOOC事业做出的贡献!(排名不分先后)
  • Coursera
  • edX
  • OpenLearning
  • FutureLearn
  • iversity
  • Udacity
  • NovoEd
  • Canvas
  • Open2Study
  • Google
  • ewant
  • FUN
  • IOC-Athlete-MOOC
  • World-Science-U
  • Codecademy
  • CourseSites
  • opencourseworld
  • ShareCourse
  • gacco
  • MiriadaX
  • JANUX
  • openhpi
  • Stanford-Open-Edx
  • 网易云课堂
  • 中国大学MOOC
  • 学堂在线
  • 顶你学堂
  • 华文慕课
  • 好大学在线CnMooc
  • 以及更多...

© 2008-2018 MOOC.CN 慕课改变你,你改变世界