# Euclid Algorithm

Learn how to write code to find the GCD using Euclid's algorithm.

## We'll cover the following

**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.

Get hands-on with 1200+ tech skills courses.