mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-18 01:00:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

pytests for closest_pair_of_points.py (#1099)

Browse Source 
added some tests to the file
This commit is contained in:
rsun0013 2019-08-06 19:17:17 +10:00 committed by Harshil
parent 22d2453773
commit 58126406fd
1 changed files with 13 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
divide_and_conquer/closest_pair_of_points.py
View File

@ -19,6 +19,19 @@ min(closest_pair_dis, closest_in_strip) would be the final answer.
Time complexity: O(n * log n) Time complexity: O(n * log n)
""" """
"""
doctests
>>> euclidean_distance_sqr([1,2],[2,4])
5
>>> dis_between_closest_pair([[1,2],[2,4],[5,7],[8,9],[11,0]],5)
5
>>> dis_between_closest_in_strip([[1,2],[2,4],[5,7],[8,9],[11,0]],5)
85
>>> points = [(2, 3), (12, 30), (40, 50), (5, 1), (12, 10), (3, 4)]
>>> print("Distance:", closest_pair_of_points(points, len(points)))
"Distance: 1.4142135623730951"
"""
def euclidean_distance_sqr(point1, point2): def euclidean_distance_sqr(point1, point2):
return (point1[0] - point2[0]) ** 2 + (point1[1] - point2[1]) ** 2 return (point1[0] - point2[0]) ** 2 + (point1[1] - point2[1]) ** 2