Big O Notation
An approximate way to express the complexity of a computer algorithm, where
only the most rapidly increasing factor is shown. Normally we are interested in
multiplications, since they are the most time-consuming to execute in general
purpose computers.
Use your browser's back button to
return to text.