1.Previous
3.Next

running time of an algorithm. In each case, c is a positive constant and n increases without bound. The slower-growing functions are generally listed first.

The statement is sometimes weakened to to derive simpler formulas for asymptotic complexity.In many of these examples, the running time isactually , which conveys moreprecision.

Little-o notation

For real or complex-valued functions of a real variable with for sufficiently large , one writes
:if

That

1.Previous
3.Next