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

13 votes136 views3 answers
Python input list of ints
Python
0 vote132 views1 answer
Differentate derivative differentation
Python
2 votes211 views2 answers
Python get file size in mb
Python
1 vote156 views2 answers
Django client ip
Python Django
0 vote142 views1 answer
Python variable definieren
Python
0 vote117 views1 answer
Python skip line
Python
1 vote149 views1 answer
Read a function of excel in python
Python
0 vote146 views2 answers
Connect two mathod to the same button in pyq5
Python
0 vote146 views1 answer
Python cls command line
Python
1 vote125 views1 answer
Python make a shop menu
Python