Big O (Definition)

Suppose f and g are non-negative functions on the domain of natural numbers N = {0, 1, ... }

f:N ? ?+

g:N ? ?+

Then f(n) is said to be O(g(n)) if and only if

there exist constants c > 0 and n0 such that whenever n > n0, we have f(n) ? c g(n)

Previous slide

Next slide

Back to first slide

View graphic version