title: Can anyone explain how this code works? GCD, Recursive, Euclidian algorighm
body: <p>Can anyone help explain to me how this code works? I am trying to understand how recursive works and how to write it. New student here, thank you.</p>
  
  <pre><code>def gcdRecur(a, b):
  '''
  a, b: positive integers
  
  returns: a positive integer, the greatest common divisor of a &amp; b.
  '''
  
  if b == 0:
      return a
  else:
      return gcdRecur(b,a % b)
  
  obj = gcdRecur(9,12)
  print (obj)
  </code></pre>