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 vote321 views1 answer
Pthon return value with highest occurences
Python
3 votes288 views1 answer
How to close the window in pygame
Python
2 votes303 views1 answer
Set axis title matplotlib
Python
107 votes285 views6 answers
Python rename columns
Python
1 vote290 views3 answers
Solve linear system python
Python
9 votes281 views2 answers
Remove all rows without a value pandas
Python
0 vote328 views1 answer
Python multi-line statement
Python
0 vote315 views2 answers
Howe to print all values and keysin d
Python
1 vote305 views1 answer
Python code to receive gmail
Python
3 votes373 views1 answer
ModuleNotFoundError: No module named 'django.core.urlresolvers'
Python Django