title: Big O of Recursive Methods
body: <p>I'm having difficulty determining the big O of simple recursive methods. I can't wrap my head around what happens when a method is called multiple times.  I would be more specific about my areas of confusion, but at the moment I'm trying to answer some hw questions, and in lieu of not wanting to cheat, I ask that anyone responding to this post come up with a simple recursive method and provide a simple explanation of the big O of said method. (Preferably in Java... a language I'm learning.)</p>
  
  <p>Thank you.</p>