Problem
The greatest common divisor (gcd) of two positive integers is the largest integer that divides both of them. Thus, for example, the gcd of 8 and 12 is 4, the gcd of 9 and 18 is 9, and the gcd of 16 and 25 is 1.
(a) Write a nonrecursive function int gcd(int x, int y), where x andy are required to be positive integers, that searches through the positive integers until it finds the largest integer dividing both x and y.
(b) Write a recursive function int gcd(int x, int y) that implements Euclid's algorithm: If y = 0, then the gcd of x and y is x; otherwise the gcd of x and y is the same as the gcd of y and x%y2
(c) Rewrite the function of part (b) into iterative form.
(d) Discuss the advantages and disadvantages of each of these methods.