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

2 votes279 views4 answers
How to add column to np array
Python
0 vote274 views1 answer
Tuples as return values
Python
1 vote325 views1 answer
Return json with flask
Python Flask
0 vote287 views1 answer
How to check if user pressed enter in python
Python
3 votes244 views4 answers
Get the path of a module in python
Python
0 vote271 views1 answer
Python - merge and incluse only specific columns
Python
2 votes314 views1 answer
How to convert list to tensor pytorch
Python
-1 vote308 views2 answers
Rename folder python
Python
0 vote309 views1 answer
Add legend to colorbar
Python
0 vote298 views1 answer
Numpy convolution stride tricks
Python