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 vote177 views2 answers
Builtwith python
Python
38 votes132 views2 answers
Python create new folder if not exist
Python
17 votes133 views2 answers
Make selenium headless python
Python
0 vote162 views1 answer
Django create ap
Python
0 vote101 views1 answer
Finetune vision model huggingface pytorch github
Python
6 votes142 views4 answers
Print all elements in list python
Python
0 vote99 views1 answer
Node alpine install python
Python
1 vote146 views1 answer
Olst = [] a = int(input()) b = int(input()) for ele in range(a,b+1): if ele%2 != 0: olst.append(ele) print(olst[::-1])
Python
5 votes144 views2 answers
Put comma in numbers python
Python
0 vote156 views1 answer
Csrf token fetch django
Python Django