title: Sum of big O notation
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/7007723/big-o-when-adding-together-different-routines">Big O when adding together different routines</a>  </p>
  </blockquote>
  
  
  
  <p>What does <code>O(n) + O(log(n))</code> reduce to? My guess is <code>O(n)</code> but can not give a rigorous reasoning.</p>
  
  <p>I understand <code>O(n) + O(1)</code> should reduce to <code>O(n)</code> since <code>O(1)</code> is just a constant. </p>