Title:
Greatest-common-divisor-(GCD)
Download
Description: Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables containing the two numbers. If n is 0, then stop: m contains the GCD.Use recursion.(There will be multiple input sets. The line contains two integer between 1 and 1000. For each test case, output one line.)
To Search:
File list (Check if you may need any files):
Greatest common divisor (GCD).doc
