Introduction to Algorithms : Time Complexity
Print this page
  
 
O - notation : For a given function is defined as
2.
          

For example, as for all

3. - notation: This notation provides asymptotic lower bound. For a given , is defined as  

For example, because , for all

   
Prev
First | Next | End