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 vote317 views1 answer
Qdate to date
Python
1 vote366 views2 answers
Flask socketio send
Python Flask
0 vote332 views2 answers
Completely uninstall python and all vritualenvs from mac
Python
0 vote300 views1 answer
Print out a name in python
Python
0 vote325 views2 answers
Return returns string with brackets python
Python
1 vote369 views1 answer
How to custom page not found in django
Python Django
8 votes317 views3 answers
Get_dummies
Python
1 vote274 views2 answers
Delete the node at a given position 2 in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value.
Python
0 vote331 views1 answer
How to draw play area for a game in python turtle
Python
3 votes333 views1 answer
Django flush
Python