[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

divide_and_conquer/closest_pair_of_points.py

@@ -18,12 +18,15 @@
 
 Time complexity: O(n * log n)
 """
+
 from __future__ import annotations
 
 from typing import Any
 
 
-def euclidean_distance_sqr(point1: list[Any] | tuple[Any, ...], point2: list[Any] | tuple[Any, ...]) -> float:
+def euclidean_distance_sqr(
+    point1: list[Any] | tuple[Any, ...], point2: list[Any] | tuple[Any, ...]
+) -> float:
     """
     >>> euclidean_distance_sqr([1, 2], [2, 4])
     5
@@ -39,7 +42,9 @@ def column_based_sort(array: list[Any], column: int = 0) -> list[Any]:
     return sorted(array, key=lambda x: x[column])
 
 
-def dis_between_closest_pair(points: list[Any], points_counts: int, min_dis: float = float("inf")) -> float:
+def dis_between_closest_pair(
+    points: list[Any], points_counts: int, min_dis: float = float("inf")
+) -> float:
     """
     brute force approach to find distance between closest pair points
 
@@ -61,7 +66,9 @@ def dis_between_closest_pair(points: list[Any], points_counts: int, min_dis: flo
     return min_dis
 
 
-def dis_between_closest_in_strip(points: list[Any], points_counts: int, min_dis: float = float("inf")) -> float:
+def dis_between_closest_in_strip(
+    points: list[Any], points_counts: int, min_dis: float = float("inf")
+) -> float:
     """
     closest pair of points in strip
 
@@ -82,7 +89,9 @@ def dis_between_closest_in_strip(points: list[Any], points_counts: int, min_dis:
     return min_dis
 
 
-def closest_pair_of_points_sqr(points_sorted_on_x: list[Any], points_sorted_on_y: list[Any], points_counts: int) -> float:
+def closest_pair_of_points_sqr(
+    points_sorted_on_x: list[Any], points_sorted_on_y: list[Any], points_counts: int
+) -> float:
     """divide and conquer approach
 
     Parameters :