Time complexity of eucladian algo and brute forece algo?
Time complexity of eucladian algo and brute forece algo?
Hey @kishoretaru
Brute force complexity is O(min(a,b))
and eculids is O(log(max(a,b))
Proof for 2nd part if u want to go in mathematics 
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.