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).
Introduction; “big-oh” notation and asymptotic analysis.
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
The QuickSort algorithm and its analysis; probability review.
Linear-time selection; graphs, cuts, and the contraction algorithm.