title: Time complexity analysis with modulus
body: <pre><code> sum = 0;
   for(i=1;i&lt;2*n;i++)
      for(j=1;j&lt;i*i;j++)
        for(k=1;k&lt;j;k++)
          if (j % i == 1)
            sum++;
  </code></pre>
  
  <p>I need to calculate the time complexity of this code in terms of big O notation. I understand how to analyze time complexity on a very basic level. My problem is the condition in the final 
  inner loop. How do I integrate it in my analysis?</p>