title: Recurrence Relation
body: <p>Why is the recurrence relation of recursive factorial algorithm this?</p>
  
  <pre><code>T(n)=1 for n=0
  T(n)=1+T(n-1) for n&gt;0
  </code></pre>
  
  <p>Why is it not this?</p>
  
  <pre><code>T(n)=1 for n=0
  T(n)=n*T(n-1) for n&gt;0
  </code></pre>
  
  <p>Putting values of n i.e 1,2,3,4...... the second recurrence relation holds(The factorials are correctly calculated) not the first one.</p>