Written by: Daniel Green, Grayland Lunn, Alex Tovar
This program demonstrates 3 different Python implementations of the divide-and-conquer algorithmic solution to the closest pair of points problem. Each Python script takes a file with single (x,y) points of any length at stdin.
Instructions for usage:
To run the enhanced-divide-and-conquer function enter the command: $ python enhanced-divide-and-conquer.py <path/to/file>
To run the naive-divide-and-conquer function enter the command: $ python naive-divide-and-conquer.py <path/to/file>
To run the brute force function enter the command: $ python run-brute-force.py <path/to/file>
To see all functions executed with randomly generated files enter the command: $ assignment_execute