Linear complexity and quadratic complexity

Question

I\'m just not sure...

If you have a code that can be executed in either of the following complexities:

1. A sequence of O(n), like for example: two O(n) i

Answer 1

C x O(n) < O(n²) is NOT always true, there is a point in n where it reverses the condition.

When C is large and n is small, then C x O(n) > O(n²). However, C is always constant, hence when n scales to a large number, C x O(n) < O(n²).

Therefore, when n is large, O(n) is always better than O(n²).