Find The Greatest Common Divisor of Two Integers Using Euclid's Algorithm
The GCD is simply the largest positive integer that will perfectly divide any two integer values in common. The signs of the integers are ignored and the GCD is always expressed as a positive value. In integer fractional arithmetic, the GCD may be used to reduce a fraction to its lowest terms by dividing both the numerator and the denominator of the fraction by this GCD. This produces the smallest integer fraction that has the same identical numerical ratio.
More information regarding the function and its usage can be found in the included readme file and the code's comments.
Instructions: Click the link below to download the code. Select 'Save' from the IE popup dialog. Once downloaded, open the .zip file from your local drive using WinZip or a comparable program to view the contents.