Question

The Euclid’s algorithm runs efficiently if the remainder of two numbers is divided by the minimum of two numbers until the remainder is zero.

(a) True

(b) False

I had been asked this question by my college director while I was bunking the class.

The query is from Number Theory topic in portion Number Theory of Data Structures & Algorithms II

Answer 1

Correct choice is (a) True

For explanation: The Euclid’s algorithm runs efficiently if the remainder of two numbers is divided by the minimum of two numbers until the remainder is zero. This improvement in efficiency was put forth by Gabriel Lame.