(algorithm)
Definition: (1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same.
Also known as GCD, highest common factor.
See also Euclid's algorithm, binary GCD, least common multiple, extended Euclid's algorithm.
Note: After [CLR90, page 804].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 4 October 2006.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "greatest common divisor", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 4 October 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/greatestCommonDivisor.html
