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 vote243 views2 answers
Composition in python
Python
1 vote294 views1 answer
Sum values in django models
Python Django
0 vote190 views1 answer
Numpy sort multidimensional array
Python
0 vote266 views1 answer
Flask stream with data/context
Python Flask
0 vote229 views1 answer
Extract all bounding boxes using OpenCV Python
Python
61 votes220 views6 answers
Python classes
Python
0 vote216 views1 answer
Set change order python
Python
1 vote229 views1 answer
List.extend
Python
19 votes224 views5 answers
Conda tensorflow
Python
0 vote230 views1 answer
Number 1
Python