EUCLID'S ALGORITHM

Domain	Definition
Computing	Euclid's Algorithm (Or "Euclidean Algorithm") An algorithm for finding the greatest common divisor (GCD) of two numbers. It relies on the identity gcd(a, b) = gcd(a-b, b) To find the GCD of two numbers by this algorithm, repeatedly replace the larger by subtracting the smaller from it until the two numbers are equal. E.g. 132, 168 -> 132, 36 -> 96, 36 -> 60, 36 -> 24, 36 -> 24, 12 -> 12, 12 so the GCD of 132 and 168 is 12. This algorithm requires only subtraction and comparison operations but can take a number of steps proportional to the difference between the initial numbers (e.g. gcd(1, 1001) will take 1000 steps). (1997-06-30). Source: The Free On-line Dictionary of Computing.
Math	An algorithm to compute the greatest common divisor of two positive integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);}. The run time complexity is O(( log a)( log b)) bit operations. (references)
Source: compiled by the editor from various references; see credits.

Anagrams: EUCLID'S ALGORITHM

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "'-a-c-d-e-g-h-i-i-l-l-m-o-r-s-t-u"
	-5 letters: modularities, radiochemist.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.