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

30 votes218 views3 answers
Iterate through all files in directory python
Python
0 vote237 views1 answer
Fiboacci in python
Python
1 vote175 views1 answer
Plus months onto python date
Python
0 vote218 views1 answer
Numpy.empty sorce code
Python
1 vote209 views1 answer
Django link home page
Python
91 votes206 views5 answers
How to delete file in python
Python
1 vote204 views1 answer
How to change the rate of speech in pyttsx3
Python
0 vote196 views1 answer
How to create empty series in pandas
Python
27 votes196 views3 answers
Python check if string or list
Python
19 votes221 views5 answers
Python floor
Python