This is an old revision of the document!
Table of Contents
Week 8
Chapter Scores
- Readability Score:
- Interest Score:
Readings
Chapter 5: Divide and Conquer
5.3: Counting Inversions
5.4: Finding the Closest Pair of Points
Problem: Given n points on an X,Y coordinate plane, find the two points that are the smallest distance away from each other than to any other two points.
The initial solution to this problem is obvious:
This algorithm, however, is inefficient because it is 
5.5: Integer Multiplication
You could leave a comment if you were logged in.
