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

Price: Enroll For Free!

Divide and Conquer, Sorting and Searching, and Randomized Algorithms – Stanford University