title: Recurrence Relation: Solving Big O of T(n-1)
body: <p>I'm solving some recurrence relation problems for Big O and so far up till this point have only encountered recurrence relations that involved this form:</p>
  
  <pre><code>T(n) = a*T(n/b) + f(n)
  </code></pre>
  
  <p>For the above, it's quite easy for me to find the Big O notation. But I was recently thrown a curve ball with the following equation:</p>
  
  <pre><code>T(n) = T(n-1) + 2
  </code></pre>
  
  <p>I'm not really sure how to go around solving this for Big O. I've actually tried plugging in the equation as what follows:</p>
  
  <pre><code>T(n) = T(n-1) + 2
  T(n-1) = T(n-2)
  T(n-2) = T(n-3)
  </code></pre>
  
  <p>I'm not entirely sure if this is correct, but I'm stuck and need some help. Thanks!</p>