This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries.

This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort.

Sorting is introduced, and motivated by problems that become easier once the inputs are sorted. The lecture covers insertion sort, then discusses merge sort and analyzes its running time using a recursion tree.

This lecture describes an algorithm as a computational procedure to solve a problem, covers the random access machine and pointer models of computation, and introduces the document distance problem.

This lecture begins with a review of graphs and applications of graph search, discusses graph representations such as adjacency lists, and covers breadth-first search.

This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability).

This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.

This recitation reviews numerics and graphs in preparation for Quiz 2.

This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering example shown in lecture.

This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph.

This recitation reviews the computational complexity concepts presented in lecture.

This recitation revisits the perfect-information blackjack problem that was covered in lecture.

This recitation covers breadth-first search for shortest paths.

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.

This recitation briefly discusses Karatsuba multiplication, then covers Newton's method.

This recitation starts with a discussion of Problem Set 5, and then covers graph representations and breadth-first search.

This recitation covers depth-first search and DFS edge classification.

This recitation mostly covers rolling hashes, with a short discussion of amortized analysis at the end.

This recitation discusses principles of algorithm design, using example problems from previous final exams.

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.

This recitation covers several practice problems for Quiz 1, taken from previous semesters of 6.006.

This recitation starts with a review of recursion trees and recurrences, and then discusses binary search trees.

This recitation covers insertion, deletion, and rebalancing of AVL trees.

This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge sort.

This recitation covers the Python cost model and looks at the code for document distance, including main and most functions except count_frequency.