I see.
To be honest I would like to get a n^3 :-), but I see what you are saying.
I have plotted it against n^3 for n from 1 to 10,000 and I guess I got carried away because it seemed to be asymptotically bounded, but of course, there's no guarantee, at all.
I will try to open the sum...
Homework Statement
I have found the complexity of an algorithm as the expression below. How can I find the complexity in big O notation for such expression? Or proved that it's bounded by n^3 or n^4 ? Thank you!
Homework Equations
\sum_{j=3}^{n} \left[(j-1)[2(j-2)-1] +...