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 vote214 views1 answer
Combine 3 jupyter cells together
Python
9 votes172 views2 answers
How to install packages inside thepython script
Python
0 vote196 views1 answer
Print all variables jupyter notebook
Python
0 vote215 views1 answer
Django table view sort filter
Python
0 vote163 views1 answer
Python tkinter interface exoskeleton
Python
12 votes178 views5 answers
Is prime python
Python
1 vote171 views2 answers
Incognito selenium
Python
0 vote184 views1 answer
How to auto create a three dimensional array in python
Python
0 vote247 views1 answer
Django populate database in view
Python Django
0 vote169 views1 answer
Thicker lines in colorbar for contourplot
Python