Divide and Conquer, Sorting and Searching, and Randomized Algorithms free videos and free material uploaded by coursera instructor .
Syllabus / What will i learn?
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
Week 3
The QuickSort algorithm and its analysis; probability review.
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
Curriculum for this course
0 Lessons
00:00:00 Hours
+ View more
Description
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).
You need online training / explanation for this course?
1 to 1 Online Training contact instructor for demo :
+ View more
Other related courses
Updated Wed, 22-Apr-2020
Updated Wed, 24-Feb-2021
Updated Wed, 22-Apr-2020
Updated Thu, 30-Apr-2020
About the instructor
- 0 Reviews
- 4 Students
- 102 Courses
Student feedback
Reviews
Write a public review