How to compute the big-O notation of a function

• The big-O notation of T(n) is determined by its dominant term.

• Examples

  • T(n) = n2+2n+1 ==> O(n2)
  • T(n)= n+logn ==> O(n)
  • T(n) = 2n+n3 ==> O(2n)

Previous slide

Next slide

Back to first slide

View graphic version