Go backward to Illustration Go up to Top Go forward to Example

Usage

• Instead of saying that the execution time T of some algorithm A in dependence on input size n is T_A(n) = 7n²+3n+19, we may say

  T_A(n) = O(n²),

• The proposition

  S₀ = S₁ + O(T)

  is to be understood as S₀ - S₁ = O(T).

  We say by

  f(n) = 5n³ + 2n² + O(n)

  that f(n) differs from 5n³ + 2n² not more than by a linear factor.