Big O notation is a mathematical notation used to describe the limiting growth rate of a function, especially the resource requirements of an algorithm as input size increases. It is commonly used to express time or space complexity while abstracting away constant factors and lower-order terms.
A mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is a member of a family of notations invented by Paul Bachmann, Edmund Landau, and others, collectively called BachmannβLandau notation or asymptotic notation.