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

7 votes362 views1 answer
Np in python
Python
4 votes325 views2 answers
Python run command and read output
Python
0 vote364 views1 answer
Crawl a folder python
Python
0 vote328 views1 answer
Least square fit straight line python
Python
0 vote327 views1 answer
Stutter function in python
Python
1 vote339 views1 answer
How to create text file with python and store a dictionary
Python
0 vote315 views1 answer
Pandas read csv skip rows
Python
0 vote338 views1 answer
Python second interval
Python
-1 vote329 views1 answer
Python date from yy/mm/dd to yy-mm-dd
Python
14 votes344 views3 answers
Python int to bytes
Python