If an algorithm does n² + 50n + 100 operations, we write O(n²).
When n is 1000, n² is 1,000,000 and 50n is 50,000. The quadratic term dominates. The linear term becomes noise.
Always keep only the term that grows fastest. Everything else is absorbed into the constant.