Introduction to Algorithms, Fall 2011 (M-I-T)

• 1. Algorithmic Thinking, Peak Finding (M-I-T)
• 2. Models of Computation, Document Distance (M-I-T)
• 3. Insertion Sort, Merge Sort (M-I-T)
• 4. Heaps and Heap Sort (M-I-T)
• 5. Binary Search Trees, BST Sort (M-I-T)
• 6. AVL Trees, AVL Sort (M-I-T)
• 7. Counting Sort, Radix Sort, Lower Bounds for Sorting (M-I-T)
• 8. Hashing with Chaining (M-I-T)
• 9. Table Doubling, Karp-Rabin (M-I-T)
• 10. Open Addressing, Cryptographic Hashing (M-I-T)
• 11. Integer Arithmetic, Karatsuba Multiplication (M-I-T)
• 12. Square Roots, Newton's Method (M-I-T)
• 13. Breadth-First Search (BFS) (M-I-T)
• 14. Depth-First Search (DFS), Topological Sort (M-I-T)
• 15. Single-Source Shortest Paths Problem (M-I-T)
• 16. Dijkstra (M-I-T)
• 17. Bellman-Ford (M-I-T)
• 18. Speeding up Dijkstra (M-I-T)
• 19. Dynamic Programming I: Fibonacci, Shortest Paths (M-I-T)
• 20. Dynamic Programming II: Text Justification, Blackjack (M-I-T)
• 22. DP IV: Guitar Fingering, Tetris, Super Mario Bros. (M-I-T)
• 23. Computational Complexity (M-I-T)
• 24. Topics in Algorithms Research (M-I-T)
• R1. Asymptotic Complexity, Peak Finding (M-I-T)
• R2. Python Cost Model, Document Distance (M-I-T)