how to find complexity for eucledian gcd approach
How to do the below
@guptanikhil898
its just like the method we use in school to find hcf as every time we doing a%b until remainder becomes 0 so log n complexity ( n=max(a,b))
i hope its clear if yes dont forget to hit like and mark resolved 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.