big O notation noun1 •A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions.
