Big-O notation

Let T(n) be the number of basic statements executed.T(n) is O(f(n)) if there exist two constants c and n0 such that T(n) <= c*f(n) if n>=n0.

Let T(n) be the number of basic statements executed. T(n) is O(f(n)) if there exist two constants c and n0 such that T(n) <= c*f(n) if n>=n0.