what will be the time complexity for this particular method (long division method) to find gcd, the solution that came upto my mind was running a loop till the min(a,b) and check the greatest number that divides both, and for my logic it become O(min(a,b))
