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

15 votes275 views3 answers
Inverse matrix python
Python
0 vote194 views1 answer
Google youtuve api python
Python
0 vote191 views1 answer
Red black tree python
Python
5 votes200 views2 answers
Converting decimal to hex in python
Python
1 vote194 views1 answer
Taking string input from user in python with try except
Python
0 vote199 views1 answer
Full_like numpy
Python
-1 vote235 views2 answers
Django view
Python Django
4 votes261 views4 answers
Generate random characters in python
Python
2 votes291 views4 answers
Numpy reshape (n ) to (n 1)
Python
0 vote211 views1 answer
Python check samplerate of mp3
Python