NT7: Euclid's Algorithm to find GCD ( O(log(min(a, b))) ) || Number Theory

In this lecture, we discuss GCD and Euclid's algorithm to find it.

Problem Discussion:

Thank You for Watching and Keep Coding.
#codeforcode