MIT 6.046J Design and Analysis of Algorithms

MIT's follow-on algorithms course from Spring 2015. Starting from a course overview with interval scheduling, the lectures and recitations cover divide and conquer (convex hull, median finding, FFT), the master theorem, amortised analysis, randomised algorithms, augmented data structures, minimum spanning trees, network flow, linear programming, NP-completeness, approximation algorithms and cryptography. It suits students who have completed MIT 6.006 or an equivalent algorithms course and want depth for advanced study or competitive programming.