Moocable 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
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).
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.
Online Courses 
Coursera
Free to Audit 
16 hours 39 minutes 
Intermediate 
Paid Certificate Divide and Conquer, Sorting and Searching, and Randomized Algorithms
1 online study group
Affiliate notice
-
TypeOnline Courses
-
ProviderCoursera
-
PricingFree to Audit
-
Duration16 hours 39 minutes
-
DifficultyIntermediate
-
CertificatePaid Certificate
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.
- 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.
Loading...
Saving...
Loading...