In this lesson, we will discuss Euclid's algorithm which is an efficient ancient algorithm to find out greatest common divisor (GCD) of two numbers.