Recitation 8: Simulation Algorithms
Recitation 8: Simulation Algorithms
This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries.
16 Aug 2013
•
55mins
Recitation 7: Comparison Sort, Counting and Radix Sort
Recitation 7: Comparison Sort, Counting and Radix Sort
This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort.
16 Aug 2013
•
51mins
Similar Podcasts
Lecture 3: Insertion Sort, Merge Sort
Lecture 3: Insertion Sort, Merge Sort
Sorting is introduced, and motivated by problems that become easier once the inputs are sorted. The lecture covers inse... Read more
16 Aug 2013
•
51mins
Lecture 2: Models of Computation, Document Distance
Lecture 2: Models of Computation, Document Distance
This lecture describes an algorithm as a computational procedure to solve a problem, covers the random access machine an... Read more
16 Aug 2013
•
48mins
Lecture 13: Breadth-First Search (BFS)
Lecture 13: Breadth-First Search (BFS)
This lecture begins with a review of graphs and applications of graph search, discusses graph representations such as ad... Read more
4 Feb 2013
•
50mins
Recitation 24: Final Exam Review
Recitation 24: Final Exam Review
This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability).
10 Dec 2012
•
51mins
Recitation 21: Dynamic Programming: Knapsack Problem
Recitation 21: Dynamic Programming: Knapsack Problem
This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.
10 Dec 2012
•
1hr 9mins
Recitation 18: Quiz 2 Review
Recitation 18: Quiz 2 Review
This recitation reviews numerics and graphs in preparation for Quiz 2.
10 Dec 2012
•
1hr 5mins
Recitation 22: Dynamic Programming: Dance Dance Revolution
Recitation 22: Dynamic Programming: Dance Dance Revolution
This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering ex... Read more
10 Dec 2012
•
53mins
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest pa... Read more
10 Dec 2012
•
52mins