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

18 votes273 views3 answers
String Slices
Python
0 vote248 views1 answer
Python pow
Python
1 vote265 views1 answer
Pygame how to change a pictures hue
Python
16 votes235 views2 answers
Python how to remove n from string
Python
0 vote245 views1 answer
Import combination
Python
0 vote252 views1 answer
Print red in python
Python
8 votes246 views1 answer
Expand all rows pandas
Python
1 vote253 views1 answer
Jupyter consumes 100 disk
Python
1 vote337 views2 answers
How to find 1 st digit in python
Python
2 votes298 views1 answer
Difference between w+ and r+ in python
Python