6.046J | Spring 2015 | Undergraduate

Design and Analysis of Algorithms

Lecture Videos

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

Description: In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future.

Instructors: Erik Demaine

Notes for Lecture 12 (PDF) are available.
Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes
Instructor Insights