title: How to find Complexity?
body: <p>How to find the time complexity {Big-Oh} of the following function?</p>
  
  <pre><code>function(int n) {
    for (int i = 0; i &lt; n; i++){
      for (int j = i; j &lt; i*i; j++){
         if (j%i == 0){
           for(int k = 0; k &lt; j; k++){
              printf(" * ");
           }
         }
      }
    }
  } 
  </code></pre>
  
  <p>Answer for this is O(n^5) but I don't know how to find that.</p>