Whats the dominant term in 2^n or n^2 for big O notation
<p>I have been looking at Big O notation and have come across an operational count <code>2^n+n^2</code>. I understand the practice of big O notation is to remove the constants and the low order terms, however I cant figure out which one to make <code>O(n)</code>. I think it may be <code>2^n</code> but have had no luck finding anything to suggest this.</p>