Python euclidean algorithm

Euclidean distance python

# I hope to be of help and to have understood the request
from math import sqrt # import square root from the math module
# the x and y coordinates are the points on the Cartesian plane
pointA = (x, y) # first point
pointB = (x, y) # second point
distance = calc_distance(pointA, pointB) # here your beautiful result
def calc_distance(p1, p2): # simple function, I hope you are more comfortable
  return sqrt((p1[0]-p2[0])**2+(p1[1]-p2[1])**2) # Pythagorean theorem

Python euclidean algorithm

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

Similar codes

0 vote338 views1 answer
How to get the current url path in django template
Python Django
0 vote276 views1 answer
Matplotlib bring plot to front in plots with twin axis
Python
3 votes261 views2 answers
Resize numpy array image
Python
1 vote308 views1 answer
What is serialization in django
Python Django
0 vote293 views1 answer
Icloud api python
Python
0 vote270 views1 answer
Pandas nat to null?
Python
4 votes375 views2 answers
How to make never ending program in python
Python
31 votes267 views6 answers
Regex to validate email
Python
0 vote314 views1 answer
Python remove consecutive spaces
Python
15 votes277 views4 answers
Python list of size
Python