an efficient method for computing the greatest common divisor (GCD) of two integers
simon-isler/euclidean-algorithms
an efficient method for computing the greatest common divisor (GCD) of two integers
Python
an efficient method for computing the greatest common divisor (GCD) of two integers
Python
an efficient method for computing the greatest common divisor (GCD) of two integers