title: Finding exact algorithm Efficiency and Big-O notation in nested loops
body: <p>The efficiency of the algorithm <code>doIt</code> can be expressed as <em>O(n) = n^3</em>. Calculate the efficiency of the following program segment exactly. Then calculate the efficiency using the big-O notation. Show calculations.</p>
  
  <pre><code>for (i = 1; i &lt;= n + 1; i++)
      for (j = 1; j &lt; n; j++)
          doIt (...);
  </code></pre>
  
  <p>Thanks in advance.</p>