The Euclidean algorithm or Euclid's Algorithm of Division for finding GCD (Greatest Common Divisor)

Finding GCD is a common problem statement. You might face this as a direct problem statement in competitive programming or as a subproblem.

There are several ways to get GCD. In the previous video, we discussed one such approach but we saw that time complexity goes till o(n) where n is max(a,b) in the worst case. We tried to further optimize the approach and hence discussed another famous algorithm which is Euclid's Algorithm of Division.

This video explains the algorithm in the simplest way possible.

[AmitKumar-pwln]

Appreciate It ! Better explanation than coding Block s