Q.9 Number theory quiz1

#1

How time complexity of gcd function is O(log(max(a,b))

#2

@harry_potter123
Unfortunately there is a very complex explanation for this
You can find it here https://stackoverflow.com/questions/3980416/time-complexity-of-euclids-algorithm
Kindly close the doubt