Lyle A. McGeoch
Office: SCCE C216
E-mail address on Amherst network: lamcgeoch
My office hours are Tuesday, 3-4:30, and Wednesday, 1-2:30. I am often available at other times, too, so feel free to get in touch.
Sundays, 5-7pm, in C101, and Thursdays, 6:30-8:30pm in C101.
Topics: the greedy approach, making change, greedy choice property, optimal substructure property; interval graphs; Dijkstra's algorithm. Next week: minimum spanning trees, then dynamic programming
Topics: sorting properties, lower bounds; counting sort, radix sort, master theorem; multiplication of n-digit integers, more master theorem examples
Topics: divide and conquer, mergesort, solving recurrences, quicksort