Recursive implementation of Greatest Common Divisor in Python : <p>Can someone please help me I am new to programming?</p>

<p>I would like to write a recursive method to get the Greatest Common Divisor in python. </p>

<p>I have been given this:</p>

<pre><code>def gcd(x, y):
    while y:
        x, y = y, x % y
    return abs(x)
</code></pre>
