title: Linear complexity and quadratic complexity
body: <p>I'm just not sure...</p>
  
  <p>If you have a code that can be executed in either of the following complexities:</p>
  
  <ol>
  <li>A sequence of O(n), like for example: two O(n) in sequence</li>
  <li>O(n&sup2;)</li>
  </ol>
  
  <p>The preferred version would be the one that can be executed in linear time. Would there be a time such that the sequence of O(n) would be too much and that O(n&sup2;) would be preferred? In other words, is the statement C x O(n) &lt; O(n&sup2;) always true for any constant C?</p>
  
  <p>Why or why not? What are the factors that would affect the condition such that it would be better to choose the O(n&sup2;) complexity?</p>