Divide and Conquer, Sorting and Searching, and Randomized Algorithms
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).
Who Should Enroll
Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
4 weeks of study, 4-8 hours/week
Tim Roughgarden, Professor of Computer Science
Coursera Course Certificate Available for a Fee
You can earn a Course Certificate for this Coursera Course. A Course Certificate is proof that you completed and passed the course.
In order to get a Course Certificate, you must: