Design and Analysis of Algorithms
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorith
ocw-origin.odl.mit.edu
Lecture Notes | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare
This section provides the schedule of lecture topics for the course along with notes developed by a student, starting from the notes that the course instructors prepared for their own use in presenting the lectures.
ocw.mit.edu
Exams | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare
This section provides quizzes, exams, solutions, practice materials, and supporting files.
ocw.mit.edu
Download Course Materials | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare
ocw.mit.edu