in python 3.5

test case

1574 9098 7156 1322 511 4721 815 17928 1267 5292 666 405 889 14787 1184 2147 2560 18128 337 1320

Test solution

10 points test file:

The minimum distance is: 947.405404249: (511, 4721)(1267, 5292)

Programming Assig (Due October 31) Implement the algorithm for the closest pair of points (Section 33.4 in the textbook). Your algorithm should input the coordinates of the points in the point-set from a text file whose format matches the test files uploaded on D2L, and output (1) the coordinates of a closest pair in the point-set and (2) the distance between the two points in the closest pair