We know that for some algorithm with time complexity of lets say `T(n) = n^2 + n + 1` we can drop the less significant terms and say that it has a worst case of `O(n^2)`.

What about when we're in the middle of calculating time complexity of an algorithm such as `T(n) = 2T(n/2) + n + log(n)`? Can we just drop the less significant terms and just say `T(n) = 2T(n/2) + n = O(n log(n))`?