I need to give a tight asymptotic bound to this recurrence relation.
The recurrence is:
T(n) = T(n-1) + 2n - 1
I realize that this is fairly simple. I am asking where to start? If I should use the substitution method, what would be a good guess? I do not need help solving it, what I need is just the start. That is where I am confused.