Summary of progressive notation

Progressive notation Summary:

The asymptotic notation includes:

(1) Θ (theta): Tight bound. Equivalent to "="

(2)       O (Greater Europe): upper bound. Equivalent to "<="

(3) O (Small Europe): the upper bound of the non-tight. Equivalent to "<"

(4) Ω (large Omega): Nether. Equivalent to ">="

(5) Ω (small Omega): the lower bound is not tight. Equivalent to ">"

Give the definition of these tokens:

O and o,ω and ω are very similar

For example O and O, for o Yes, there are C and N0, and O is arbitrary c>0, exists n0>0

S.T. f (n) <=CG (n) s.t. f (n) <CG (n)

Then there are some points of knowledge about similar bugs in the introduction to the algorithmic book:

(1) f (n) = n^3 + O (n^2) means that there is h (n) belonging to O (n^2) s.t. f (N) = n^3 + H (n)

(2) n^2 = O (n) = O (n^2) means that any f (n) that belongs to O (n) exists h (n) belongs to O (n^2) s.t. n^2 + f (n^2) = h (n)

(3) All lgn in the book refer to log2n!!

As for transitivity, reflexivity, symmetry and so on are relatively simple, can read, self-understanding