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 vote139 views1 answer
Tanimoto coefficient rdkit
Python
8 votes125 views4 answers
How to reverse a dictionary in python
Python
2 votes96 views1 answer
Python short circuit
Python
1 vote138 views1 answer
Bytes-like object
Python
0 vote127 views1 answer
Printing float number python
Python
0 vote141 views1 answer
Sharpdevelop pause python code
Python
0 vote128 views1 answer
Python chunk text
Python
0 vote142 views2 answers
Print current line number python
Python
0 vote121 views2 answers
Python capture stdout
Python
38 votes124 views3 answers
Python print datetime
Python