Algorithmic Thinking & Peak Finding in 1D and 2D

MIT 6.006 Lecture 2: Models of Computation, Random Access Machine & Document Distance

MIT 6.006 Lecture 3: Insertion Sort, Binary Insertion & Merge Sort Recurrences

MIT 6.006 Lecture 4: Priority Queues, Binary Heaps & O(n) Build-Max-Heap

MIT 6.006 Lecture 5: Binary Search Trees & Runway Reservation Scheduling

MIT 6.006 Lecture 6: AVL Trees, Tree Rotations & Guaranteed O(log n) Height

MIT 6.006 Lecture 7: Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort

MIT 6.006 Lecture 8: Hashing with Chaining, Simple Uniform Hashing & Universal Families

Lecture 9: Table Doubling, Karp-Rabin (6.006)

Lecture 10: Open Addressing, Cryptographic Hashing (6.006)

Lecture 11: Integer Arithmetic, Karatsuba Multiplication (6.006)

Lecture 12: Square Roots, Newton's Method (6.006)

Lecture 13: Breadth-First Search (BFS) (6.006)

Lecture 14: Depth-First Search (DFS), Topological Sort (6.006)

Lecture 16: Dijkstra (6.006)

Lecture 17: Bellman-Ford (6.006)

Lecture 18: Speeding up Dijkstra (6.006)

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths (6.006)

Lecture 20: Dynamic Programming II: Text Justification, Blackjack (6.006)

Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack (6.006)

Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros. (6.006)