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).
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University
via Coursera
Instructor(s)
Tim Roughgarden
Stanford University
via Coursera
Free (audit)
English
Paid Certificate Available
Approx. 17 hours to complete
Self paced
Intermediate Level
Subtitles: Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish