English

Noun

big O notation ‎(uncountable)

1. (mathematics, computing theory) A particular notation which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. Useful in the analysis of algorithms.

See also

• time complexity