title: Worst case time complexity analysis pseudocode
body: <p>Could someone help me out with the time complexity analysis on this pseudocode?
  I'm looking for the worst-case complexity here, and I can't figure out if it's O(n^4), O(n^5) or something else entirely. If you could go into detail into how you solved it exactly, it would be much appreciated.</p>
  
  <pre><code>sum = 0
  for i = 1 to n do
     for j = 1 to i*i do
         if j mod i == 0 then
            for k = 1 to j do
                sum = sum + 1
  </code></pre>