MIT 6.006 Introduction to Algorithms (2020)
- Course audio
- Course audio: English
- Level
- Intermediate
- Length
- 15 lessons
What you'll be able to do
- Analyse running time with asymptotic notation
- Use hashing, balanced trees and heaps
- Apply graph algorithms and dynamic programming
About this course
MIT's core algorithms course from Spring 2020, taught by Erik Demaine, Jason Ku and Justin Solomon, with recorded problem sessions between lectures. It covers algorithms and computation, data structures and dynamic arrays, sorting, hashing, binary trees and AVL balancing, heaps, graph search with BFS and DFS, shortest paths with Bellman-Ford and Dijkstra, and dynamic programming. It suits CS students after a first programming course and discrete maths, and is excellent preparation for technical interviews. Follow with MIT 6.046J.
Before you start: Python programming and basic discrete maths
Syllabus
Sabaq lists the first 15 videos of this playlist; the rest continue on YouTube. Full playlist on YouTube
- 11. Algorithms and Computation
- 22. Data Structures and Dynamic Arrays
- 3Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...
- 43. Sets and Sorting
- 54. Hashing
- 6Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)
- 75. Linear Sorting
- 8Problem Session 3
- 96. Binary Trees, Part 1
- 107. Binary Trees, Part 2: AVL
- 11Problem Session 4
- 128. Binary Heaps
- 139. Breadth-First Search
- 14Quiz 1 review
- 1510. Depth-First Search
What to take next
Related courses
Videos by MIT OpenCourseWare, played from their official YouTube channel. Subscribe on YouTube
Licence: CC BY-NC-SA 4.0, MIT OpenCourseWare, ocw.mit.edu. Free for everyone, never sold.
Sabaq lists the first 15 videos of this playlist; the rest continue on YouTube. Full playlist on YouTube
Lessons last checked Oct 2026. Course summary and lesson structure by Sabaq.
Report a problem or a rights request