Algorithm Analysis (Big-O Notation)

A mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity, commonly used to classify algorithms by how their running time or space requirements grow as the input size grows.