Customize your search:

E.g., 2016-10-27
E.g., 2016-10-27
E.g., 2016-10-27
Oct 24th 2016

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

No votes yet
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)