The greatest common divisor (GCD) of two or more integers is the largest positive integer that divides each of the integers. For example, the GCD of 8 and 12 is 4. Find the GCD of two numbers using recursion in MATLAB programming. Hint: You may assume that the rst number is always smaller than the second number.

Example1

First number for GCD: 2

Second number for GCD: 10

The GCD of 2 and 10 is 2

Example2

First number for GCD: 10

Second number for GCD: 50

The GCD of 10 and 50 is 10