closest_pair_of_points.py

Author: fredlee-al

divide_and_conquer/closest_pair_of_points.py

@@ -101,22 +101,24 @@ def closest_pair_of_points_sqr(points_sorted_on_x, points_sorted_on_y, points_co
     # recursion
     mid = points_counts // 2
     closest_in_left = closest_pair_of_points_sqr(
-        points_sorted_on_x, points_sorted_on_y[:mid], mid
-    )
-    closest_in_right = closest_pair_of_points_sqr(
-        points_sorted_on_y, points_sorted_on_y[mid:], points_counts - mid
-    )
-    closest_pair_dis = min(closest_in_left, closest_in_right)
+    points_sorted_on_x, points_sorted_on_y[:mid], mid
+)
+closest_in_right = closest_pair_of_points_sqr(
+    points_sorted_on_x, points_sorted_on_y[mid:], points_counts - mid
+)
+closest_pair_dis = min(closest_in_left, closest_in_right)
+
 
     """
     cross_strip contains the points, whose Xcoords are at a
     distance(< closest_pair_dis) from mid's Xcoord
     """
+cross_strip = []
+mid_x = points_sorted_on_x[mid][0]  # x-coordinate of the middle point
+for point in points_sorted_on_x:
+    if abs(point[0] - mid_x) < closest_pair_dis:
+        cross_strip.append(point)
 
-    cross_strip = []
-    for point in points_sorted_on_x:
-        if abs(point[0] - points_sorted_on_x[mid][0]) < closest_pair_dis:
-            cross_strip.append(point)
 
     closest_in_strip = dis_between_closest_in_strip(
         cross_strip, len(cross_strip), closest_pair_dis