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

4 votes192 views2 answers
Login system in django
Python
0 vote213 views1 answer
Beautifulsoup remove empty tags
Python
0 vote221 views1 answer
Type object 'SparkContext' has no attribute '_jsc'
Python
0 vote224 views1 answer
Finding the Sum of a Symmetrical Sub-List
Python
0 vote182 views1 answer
Loginrequiredmixin django
Python
0 vote215 views1 answer
How can space be bent
Python
78 votes203 views6 answers
How to wait in python
Python
0 vote200 views2 answers
Arg parse array argument
Python
2 votes207 views2 answers
Write object to file python
Python
11 votes214 views2 answers
Python execute time
Python