title: Obfuscated C recursion Code Please explain
body: <p>I'm trying to learn recusrion from a book, but there's something that's not being explained clearly enough for me.</p>
  
  <p>The following code </p>
  
  <pre><code>int f(int n, int x, int y)
  {
  if(n==0) return x+y;
  if(y==0) retun x;
  return f(n-1,f(n,x,y-1),f(n,x,y-1)+y);
  }
  </code></pre>
  
  <p>what happen if i call f(1,2,2);</p>
  
  <p>any help with explain and thanks </p>