title: Time complexity for a triple for loop
body: <p><strong>What have I done before</strong></p>
  
  <p><a href="https://stackoverflow.com/questions/15052528/asymptotic-analysis-of-three-nested-for-loops">Asymptotic analysis of three nested for loops</a></p>
  
  <p>I was solving the time complexity of this algorithm.
  seeing that the outer loop runs <code>n</code> times and inner loop 1 runs <code>i</code> times, I applied the summation and got the two outer loops' complexity to be n(n plus 1)/2. 
  Then the inner loop executes j times equals to summation of j from j is 0 to j is n(n plus 1)/2. This yields the total complexity of O(n4).</p>
  
  <p><strong>The problem</strong></p>
  
  <p><a href="https://stackoverflow.com/questions/15052528/asymptotic-analysis-of-three-nested-for-loops">Asymptotic analysis of three nested for loops</a></p>
  
  <p>Seems like my answer is wrong. Where did I made the mistake?</p>