title: Big O Theory- triple nested loop
body: <p>If I have a function of:</p>
  
  <pre><code>for(i=0;i&lt;n;i++)
     for(j=0;j&lt;i*i;j++)
        for(k=0;k&lt;j;k++)
           System.out.println(k);
  </code></pre>
  
  <p>Would the <code>big O</code> of this function be <code>n^5</code> from having:
  <code>n*((n-1)^2)*((n-1)^2)-1</code>?</p>