I found this nested loop to calculate the Big-O notation.
for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++)
I got the time complexity for the algorithm with this polynomial equation. Suppose C1, C2 and C3 are time constants for each loop. Please note inner loop goes to i*i.
T(n) = C1(n) + C2(n/2)(n+1) + C3(n)(n^2)(n^2+1)/2
According to this, it has the time complexity of
O(n^5) Am I right on the equation?