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 vote173 views1 answer
How to check how many Python packages installed
Python
6 votes194 views3 answers
Argparse type
Python
32 votes288 views6 answers
Python Map function
Python
0 vote154 views1 answer
TypeError: 'frozenset' object is not callable
Python
9 votes163 views3 answers
SettingWithCopyWarning: A value is trying to be set on a copy of a slice from a DataFrame. Try using .loc[row_indexer,col_indexer] = value instead
Python
0 vote209 views4 answers
Unpacking of tuples in python
Python
40 votes157 views3 answers
Train dev test split sklearn
Python
0 vote167 views1 answer
Np arange shape
Python
1 vote170 views1 answer
Python sum of list axes
Python
0 vote169 views1 answer
Python terminate program after specific time
Python