Suppose one algorithm takes 10n steps and another takes n steps. Both are O(n).
The constant 10 matters for small inputs, but as n grows to millions, the difference between 10n and n becomes irrelevant compared to the difference between n and n².
Big O captures the shape of growth, not the multiplier. Constants vanish when you compare classes.