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 vote306 views2 answers
Torch print full tensor
Python
0 vote287 views1 answer
For in list start with index python
Python
0 vote305 views1 answer
Decimal characters python
Python
76 votes334 views6 answers
For loop in python
Python
-1 vote315 views2 answers
Python program to multiplies all the items in a list using function
Python
0 vote270 views1 answer
In np array how to make element as 1 if it exceeds the threshold
Python
10 votes355 views5 answers
Zip python
Python
3 votes323 views1 answer
Execute Python in Notepad++
Python
0 vote302 views1 answer
Duplicate finder python modules
Python
2 votes292 views1 answer
Pass python parameters via cmd
Python