According to Gabriel lame, how many steps does Euclid’s algorithm require to solve a problem?
(a) Less than five times the number of digits
(b) More than five times the number of digits
(c) Less than two times the number of digits
(d) More than two times the number of digits
I got this question in unit test.
My doubt stems from Number Theory in chapter Number Theory of Data Structures & Algorithms II