time complexity of gcd euclid algo??
Euclid algorithm
Its time complexity is nearly O(log n).
Refer this for more detail https://codility.com/media/train/10-Gcd.pdf
Which type of pdf is this can you send full pdf?
I just google it and found it for your understanding.
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.