This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
This course is taught by Prof. Erik Demaine, Prof. Srinivas Devadas, and Prof. Nancy Lynch.
Erik Demaine, Srinivas Devadas, and Nancy Lynch. 6.046J Design and Analysis of Algorithms, Spring 2015. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu
(Accessed 3 Apr, 2016). License: Creative Commons BY-NC-SA