Customize your search:

E.g., 2017-02-25
E.g., 2017-02-25
E.g., 2017-02-25
Feb 27th 2017

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

Average: 7.7 (3 votes)
Oct 3rd 2016

In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures, randomized algorithms, and more.

Average: 6.4 (5 votes)