Cover Data Structures and Algorithms with Object-Oriented Design Patterns in Java
next up previous contents index

Conventions for Writing Big Oh Expressions

Certain conventions have evolved which concern how big oh expressions are normally written:

Of course, in order for a particular big oh expression to be the most useful, we prefer to find a tight asymptotic bound (see Definition gif). For example, while it is not wrong to write tex2html_wrap_inline58834, we prefer to write f(n)=O(n), which is a tight bound.

Certain big oh expressions occur so frequently that they are given names. Table gif lists some of the commonly occurring big oh expressions and the usual name given to each of them.

 

 

expression name
O(1) constant 
tex2html_wrap_inline58840 logarithmic 
tex2html_wrap_inline58842 log squared 
O(n) linear 
tex2html_wrap_inline58846 n log n
tex2html_wrap_inline58122 quadratic 
tex2html_wrap_inline58434 cubic 
tex2html_wrap_inline58856 exponential 
Table: The names of common big oh expressions.


next up previous contents index

Bruno Copyright © 1998 by Bruno R. Preiss, P.Eng. All rights reserved.