Euclidean algorithm is use to find the greatest common denominator(GCD) of 2 integers. The larger integer is divided by the smaller integer and if the

Skip to content
# Tag: Algorithm

## Finding the greatest common denominator(GCD) of 2 integers.

Euclidean algorithm is use to find the greatest common denominator(GCD) of 2 integers. The larger integer is divided by the smaller integer and if the