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

1 vote111 views2 answers
How to find 1 st digit in python
Python
-1 vote136 views1 answer
Django filter on related field
Python Django
5 votes107 views2 answers
Columns to dictionary pandas
Python
0 vote71 views1 answer
Python ctypes maximize window
Python
0 vote92 views1 answer
Python sum 1-50
Python
0 vote101 views1 answer
Jupyter notebook loading bar
Python
0 vote126 views1 answer
Pyqt graph
Python
1 vote99 views2 answers
Correlation between two columns pandas
Python
0 vote101 views1 answer
Pytorch multiply tensors element by elementwise
Python
20 votes108 views2 answers
Fastapi
Python