Greatest Common Divisor

The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, defined recursively as follows:Ifyisequalto0,then gcd(x,y) is x; otherwise, gcd(x, y) is gcd(y, x % y), where% is the modulus operator. [Note x must be greater than y]

---------------------------------------

CODE

---------------------------------------

// Recursive greatest common divisor. #include using namespace std;

unsigned gcd(unsigned int, unsigned int); // function prototype