Is O(N) always faster than O(2N)?
In real-world milliseconds, O(N) is twice as fast. But in Big O academic notation, they belong to the exact same 'Linear' classification bucket.
Verify This Answer
Cross-check this information using these trusted sources:
More FAQs in Why We Drop Constants in Big O Notation
Because Big O describes the overarching growth trend as data scales to infinity. A multiplier of 2 does not change the fact that the growth is linear.
It is a slower-growing term in a mathematical equation. For example, in O(N^2 + N), the N is non-dominant because as numbers get huge, N^2 completely overshadows it.
Mathematically it is O(3N), but following Big O rules, we drop the constant 3, making the final official time complexity O(N).
Still have questions?
Browse all our FAQs or reach out to our support team