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.