I am trying to understand how to work out time complexities given certain recurrence relation, however I know that in certain recurrence relation some numbers can be omitted since they make no difference when $n$ gets very large. The problem i'm having is being able to identify the numbers that can be omitted.
$T(n) = 3T(n/3 - 2) + n/2$ Can we omit the 2's here and use the master theorem on
$T(n)=3T(n/3) + n$ ?
What about the following
$T(n) = T(n-2) + n^2$ can we say that $T(n) = T(n) + n^2$ and once again use the master theorem?
Not really clear to me when it is OK to omit numbers.