Euclid Algorithm

Euclid’s algorithm is one of the oldest algorithms still relevant today, not only in discrete mathematical conceptions but also in the computational world of 1s and 0s.

About a thousand years ago, Greek mathematicians used Euclid’s algorithm to find the greatest common divisors of two numbers. Originally, it was subtraction based; later, the same algorithm was written in numerous ways, remodeling the original one.