Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)

Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)
Course Auditing
Categories
Effort
Certification
Languages
Misc

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

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

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Course 1 of 4 in the Algorithms Specialization.


Syllabus


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.



7
Average: 7 ( 4 votes )

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.