CS130B 2017 Spring Program 1
============================
Implement brute-force and divide-and-conquer solutions
to solve the closest pair of points problem in 2 dimensions.

Notes About Sample Test Cases
-----------------------------
1.  To make comparisons between text files simple,
    the closest pair of points should have at least
    one decimal place printed e.g. 1.0 but 7 decimal
    places max.
2.  The number of comparisons in the sample output files
    may differ from the number of comparisons in your
    implementations.  However, the number of comparisons
    in the divide-and-conquer solution should be smaller
    than the number of comparisons in your brute-force
    solution for all sample test cases.