Algorithms
MIT 6.006 Introduction to Algorithms: lecture notes in plain English
Taking this course, or one like it at school? LessonBound teaches every lecture part by part, quizzes you so you know it stuck, and reads it to you with your screen off. Free, no ads.
Learn this course freeLectures with notes
- Lecture 1: Algorithms and Computation
5 parts explained
- Lecture 2: Data Structures and Dynamic Arrays
5 parts explained
- Lecture 3: Sets and Sorting
5 parts explained
- Lecture 4: Hashing
5 parts explained
- Lecture 6: Binary Trees, Part 1
5 parts explained
- Lecture 7: Binary Trees, Part 2: AVL
6 parts explained
- Lecture 8: Binary Heaps
5 parts explained
- Lecture 9: Breadth-First Search
5 parts explained
- Lecture 10: Depth-First Search
5 parts explained
- Lecture 11: Weighted Shortest Paths
6 parts explained
- Lecture 13: Dijkstra
6 parts explained
- Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
6 parts explained
- Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins
6 parts explained
19 more lectures in this course can be learned in the app, and get notes here as people study them.
Notes written by AI (Claude) from the official transcripts. MIT OpenCourseWare · CC BY-NC-SA 4.0 · not affiliated with or endorsed by MIT. These notes are shared under the same license.
LessonBound · Free lecture notes · Privacy · Terms · New York