Implement divide and conquer #3

Merged
cromer merged 9 commits from divide_and_conquer into master 2018-12-12 18:51:24 -03:00
Showing only changes of commit 2e3d2b43ee - Show all commits

View File

@ -172,13 +172,13 @@ int main (int argc, char **argv) {
if (divide) {
start_algorithm("Divide and conquer corriendo... ", n);
//closest_points = divide_and_conquer(points, n, &dist);
closest_points = divide_and_conquer(points, n, &dist);
end_algorithm();
/*printf("point 1: x: %f y: %f\n", closest_points[0].x, closest_points[0].y);
printf("point 1: x: %f y: %f\n", closest_points[0].x, closest_points[0].y);
printf("point 2: x: %f y: %f\n", closest_points[1].x, closest_points[1].y);
printf("distance: %lf\n", dist);
free(closest_points);
closest_points = NULL;*/
closest_points = NULL;
}
free(points);