算法学习之“Omega“、“Theta”和“Little Oh”

一、An asymptotical lower bound - Omega

The big oh notation introduced in the preceding section is an asymptotic upper bound. In this section, we introduce a similar notation for characterizing the asymptotic behavior of a function, but in this case it is a lower bound.

Definition (Omega)        Consider a function  f( n) which is non-negative for all integers  . We say that `` f( n) is omega  g( n),'' which we write  , if there exists an integer   and a constant  c>0 such that for all integers  ,  .

The definition of omega is almost identical to that of big oh. The only difference is in the comparison--for big oh it is