title: Big Theta Computation
body: <p>Could someone please point me in the right direction for this question?  I need to compute the big theta run time of this function.  I understand that it will run the sum++ (n^2)(n+2) times, but I am unsure how to calculate the big theta for it.  Sorry for a n00b questions, but is it just going to be the highest order?  n^3?</p>
  
  <pre><code>for (int i=0; i &lt;= n+2; i++)
  
     for (int j=0; j &lt; n * n; j++)
  
        sum++;
  </code></pre>