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 vote125 views3 answers
Find next multiple of 5 python
Python
0 vote118 views1 answer
How to get session value in django template
Python
2 votes148 views1 answer
Pandas drop all columns except certain ones
Python
0 vote125 views2 answers
Jama python rest api
Python
30 votes127 views2 answers
Matplotlib change text size
Python
0 vote143 views1 answer
Python datetime floor to hour
Python
0 vote152 views1 answer
Python logger format time
Python
25 votes130 views6 answers
Python check for integer
Python
0 vote121 views1 answer
Abrir notebooks jupyter administrador de archivos
Python
6 votes131 views2 answers
Google search api python
Python