You are viewing a single comment's thread. Return to all comments →
for, for would be O(n^2)
but we have for, for and for
With time complexity we drop out the constant term.
"For example, if the time required by an algorithm on all inputs of size n is at most 5n^3 + 3n for any n (bigger than some n_0), the asymptotic time complexity is O(n^3)."
... you're right^^