Can’t understand the time complexity of GCD algorithm. I know the algorithm is -> return (b==0) a : gcd (b, a%b)
please go through this article
if u still have some problem understanding please ping back