Graduate Algorithms

In Monday’s lecture, we will cover material from Ch. 5 of the textbook. Specifically, we will examine the role of divide-and-conquer in designing efficient algorithms for mergesort (5.1), multiplying numbers (5.5), and computing the closest pair of a set of points in the plane (5.4).

This entry was posted on Sunday, August 26th, 2007 at 1:01 am and is filed under Lectures, News.