title: Run time of nested loops
body: <p>Sorry if this question has already been asked, I wasn't sure how to search for it.</p>
  
  <p>Say you have the following loop</p>
  
  <pre><code>    for (i=0; i &lt; n; i++)
           for(j = i; j &lt; n; j++)
  </code></pre>
  
  <p>Would this be O(n^2) or O(nlog(n)) and why?</p>