Home » Courses » Electrical Engineering and Computer Science » Introduction to Algorithms » Recitation Videos
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, Newton's Method
Recitation 13: Breadth-First Search (BFS)
Recitation 14: Depth-First Search (DFS)
Recitation 15: Shortest Paths
Recitation 16: Rubik's 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
Recitation 24: Final Exam Review