title: How can I calculate the exact worst-case running time of a function given by a recurrence?
body: <p>I am trying to calculate the value of the running time at the worst case for a function whose worst-case runtime is given by this recurrence:</p>
  
  <blockquote>
    <p>T(0) = 0</p>
    
    <p>T(n) = n + T(n - 1) (if n > 0)</p>
  </blockquote>
  
  <p>Does anyone have any advice how to do this? I don't see how to solve this.</p>