Algorithms Complexity

Question

Comments

@sakharam

your explanation was correct, it is θ( n⁴ ) only

@phaneendrababu

θ( n⁴ )  = O(n⁵) ----- it is also correct, but we choose lower bound always ===> it is θ( n⁴ )

---

The outer loop has 'n' iterations.For each outer loop the first inner loop has 'n^2' iterations,For some iterations of the first inner loop the second inner loop has 'n(n+1)/2' iterations. So,the time complexity is O(n)*O(n^2)*O(n^2)==>O(n^5).

---

Look at this once , this is from Narasimha Karumanchi ,IIT Bombay 

Answer 1

Answer is  O(n⁴)