What is the total running time of Euclid’s algorithm?
(a) O(N)
(b) O(N log M)
(c) O(N log N)
(d) O(log N +1)
I have been asked this question in an interview.
My enquiry is from Number Theory in section Number Theory of Data Structures & Algorithms II