• + 1 comment

    With time complexity we drop out the constant term.

    https://en.wikipedia.org/wiki/Time_complexity

    "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)."