Introduction to Algorithms - Recitation 9b: DNA Sequence ...
Introduction to Algorithms - Recitation 9b: DNA Sequence Matching
Description: This recitation starts with a short discussion of hashing, and then discusses problem set code for most of the hour. Amortized analysis is also discussed briefly. Instructor: Victor Costan
Introduction to Algorithms - Recitation 9: Rolling Hashes, ...
Introduction to Algorithms - Recitation 9: Rolling Hashes, Amortized ...
Description: This recitation mostly covers rolling hashes, with a short discussion of amortized analysis at the end. Instructor: Victor Costan
Introduction to Algorithms - Recitation 8: Simulation ...
Introduction to Algorithms - Recitation 8: Simulation Algorithms
Description: This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries. Instructor: Victor Costan
Introduction to Algorithms - Recitation 7: Comparison Sort, ...
Introduction to Algorithms - Recitation 7: Comparison Sort, Counting and ...
Description: This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort. Instructor: Victor Costan
Introduction to Algorithms - Recitation 6: AVL Trees
Introduction to Algorithms - Recitation 6: AVL Trees
Description: This recitation covers insertion, deletion, and rebalancing of AVL trees. Instructor: Victor Costan
Introduction to Algorithms - Recitation 5: Recursion Trees, ...
Introduction to Algorithms - Recitation 5: Recursion Trees, Binary Search ...
Description: This recitation starts with a review of recursion trees and recurrences, and then discusses binary search trees. Instructor: Victor Costan
Introduction to Algorithms - Recitation 3: Document ...
Introduction to Algorithms - Recitation 3: Document Distance, Insertion ...
Description: This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge sort. Instructor: Victor Costan
Introduction to Algorithms - Recitation 2: Python Cost ...
Introduction to Algorithms - Recitation 2: Python Cost Model, Document ...
Description: This recitation covers the Python cost model and looks at the code for document distance, including main and most functions except count_frequency. Instructor: Victor Costan
Introduction to Algorithms - Recitation 24: Final Exam ...
Introduction to Algorithms - Recitation 24: Final Exam Review
Description: This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability). Instructor: Victor Costan
Introduction to Algorithms - Recitation 23: Computational ...
Introduction to Algorithms - Recitation 23: Computational Complexity
Description: This recitation reviews the computational complexity concepts presented in lecture. Instructor: Victor Costan
Introduction to Algorithms - Recitation 22: Dynamic ...
Introduction to Algorithms - Recitation 22: Dynamic Programming: Dance ...
Description: This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering example shown in lecture. Instructor: Victor Costan
Introduction to Algorithms - Recitation 21: Dynamic ...
Introduction to Algorithms - Recitation 21: Dynamic Programming: Knapsack ...
Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time. Instructor: Victor Costan
Introduction to Algorithms - Recitation 20: Dynamic ...
Introduction to Algorithms - Recitation 20: Dynamic Programming: Blackjack
Description: This recitation revisits the perfect-information blackjack problem that was covered in lecture. Instructor: Victor Costan
Introduction to Algorithms - Recitation 1: Asymptotic ...
Introduction to Algorithms - Recitation 1: Asymptotic Complexity, Peak ...
Description: This recitation covers asymptotic complexity, recurrences, and peak finding. Instructor: Victor Costan
Introduction to Algorithms - Recitation 19: Dynamic ...
Introduction to Algorithms - Recitation 19: Dynamic Programming: Crazy ...
Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph. Instructor: Victor Costan
Introduction to Algorithms - Recitation 18: Quiz 2 Review
Introduction to Algorithms - Recitation 18: Quiz 2 Review
Description: This recitation reviews numerics and graphs in preparation for Quiz 2. Instructor: Victor Costan
Introduction to Algorithms - Recitation 16: Rubik's Cube, ...
Introduction to Algorithms - Recitation 16: Rubik's Cube, StarCraft Zero
Description: This recitation discusses the Rubik's cube problem from Problem Set 6, and then uses a graph model to find an optimal build order for a simplified version of the StarCraft game. Instructor: Victor Costan
Introduction to Algorithms - Recitation 15: Shortest Paths
Introduction to Algorithms - Recitation 15: Shortest Paths
Description: This recitation covers breadth-first search for shortest paths. Instructor: Victor Costan
Introduction to Algorithms - Recitation 14: Depth-First ...
Introduction to Algorithms - Recitation 14: Depth-First Search (DFS)
Description: This recitation covers depth-first search and DFS edge classification. Instructor: Victor Costan
Introduction to Algorithms - Recitation 13: Breadth-First ...
Introduction to Algorithms - Recitation 13: Breadth-First Search (BFS)
Description: This recitation starts with a discussion of Problem Set 5, and then covers graph representations and breadth-first search. Instructor: Victor Costan