Summary: CSE 241 Algorithms and Data Structures
Finding Closest Pair
Assigned: 01/26/2011 Due Date: 02/16/2011
You must read and sign the following statement to get credit for this assignment.
Please turn it on on the due date of the lab.
I have read and understood the CSE 241 collaboration policy posted on the course web site. I
understand that these rules govern assignments given in this class, and that violations are subject
to severe penalties. I have neither violated the collaboration policy nor helped others to violate it
in completing this assignment.
This lab has several goals:
· Ensure that you understand the closest-pair algorithms studied in class.
· Ensure that you understand and can implement at least one of the sorting algorithms.
· Give a first-hand understanding of the practical benefits of nontrivial algorithm design, in
particular the divide-and-conquer methodology.
· Get you to set up and familiarize yourself with the working environment in which you'll be
doing the rest of your 241 labs.