Uploaded October 2013 | Updated September 2026, 2 weeks ago

---

See complete series on maths problems here:
youtube.com/playlist?list=PL2_aWCzGMAwLL-mEB4ef20f3iqWMGWa25

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.

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool