MIT · Computer Science
6.006 Introduction to Algorithms
Erik Demaine, Srini Devadas · 2011 · 46 free video lectures
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 1: algorithmic thinking peak finding
- Lecture 2: models of computation document distance
- Lecture 3: insertion sort merge sort
- Lecture 4: heaps and heap sort
- Lecture 5: binary search trees bst sort
- Lecture 6: avl trees avl sort
- Lecture 7: counting sort radix sort lower bounds for sorting
- Lecture 8: hashing with chaining
- Lecture 9: table doubling karp rabin
- Lecture 10: open addressing cryptographic hashing
- Lecture 11: integer arithmetic karatsuba multiplication
- Lecture 12: square roots newtons method
- Lecture 13: breadth first search bfs
- Lecture 14: depth first search dfs topological sort
- Lecture 15: single source shortest paths problem
- Lecture 16: dijkstra
- Lecture 17: bellman ford
- Lecture 18: speeding up dijkstra
- Lecture 19: dynamic programming i fibonacci shortest paths
- Lecture 20: dynamic programming ii text justification blackjack
- Lecture 21: dp iii parenthesization edit distance knapsack
- Lecture 22: dp iv guitar fingering tetris super mario bros
- Lecture 23: computational complexity
- Lecture 24: topics in algorithms research
- Recitation 1 asymptotic complexity peak finding
- Recitation 2 python cost model document distance
- Recitation 3 document distance insertion and merge sort
- Recitation 5 recursion trees binary search trees
- Recitation 6 avl trees
- Recitation 7 comparison sort counting and radix sort
- Recitation 8 simulation algorithms
- Recitation 9 rolling hashes amortized analysis
- Recitation 9b dna sequence matching
- Recitation 10 quiz 1 review
- Recitation 11 principles of algorithm design
- Recitation 12 karatsuba multiplication newtons method
- Recitation 13 breadth first search bfs
- Recitation 14 depth first search dfs
- Recitation 15 shortest paths
- Recitation 16 rubiks cube starcraft zero
- Recitation 18 quiz 2 review
- Recitation 19 dynamic programming crazy eights shortest path
- Recitation 20 dynamic programming blackjack
- Recitation 21 dynamic programming knapsack problem
- Recitation 22 dynamic programming dance dance revolution
- Recitation 23 computational complexity
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights