Euclid Greatest Common Denominator

The greatest common denominator (Euclid GDC) is a simple algorithm, which finds for two positive integer number the greatest denominator. A solution in the Flowgorithm - DOWNLOAD [ZIP]	xxx