Free Online Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms provided by Coursera is a comprehensive online course, which lasts for 4 weeks long, 17 hours worth of material. The course is taught in English and is free of charge. Upon completion of the course, you can receive an e-certificate from Coursera. Divide and Conquer, Sorting and Searching, and Randomized Algorithms is taught by Tim Roughgarden.
4 weeks long, 17 hours worth of material
In progress
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).
