This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort.
Published 08/16/13
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.
Published 08/16/13
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.
Published 08/16/13