Description
This is the full lecture video series for MIT’s undergraduate algorithms course, taught by Charles Leiserson and Erik Demaine. The course covers a wide spectrum of fundamental algorithmic topics: from basic sorting algorithms, asymptotic analysis, divide & conquer, data structures (trees, hashing), dynamic programming, graph algorithms (shortest paths, MST), to more advanced topics in the later lectures. Though a couple of lectures (20 and 21) are not available in video form, most sessions are online, along with supporting readings, problem sets, and course materials. Altogether it’s a deeply valuable resource for anyone who wants a rigorous, structured introduction (or refresher) to algorithmic theory and practice.
