Big O notation Optimization Foundations
noun phrase
Domain: algorithms, computational complexity
Definition: Mathematical notation describing the asymptotic upper-bound behavior (growth rate) of a function, commonly used to express algorithmic complexity [Bakanach 2023/2024].
Example in context: “The constants hidden inside the big-O notation depend on the nature of the function and can become quite large, which can explain differences in empirical evaluation.”[Mazoure et al. 2022]
Related terms: asymptotic complexity, time complexity, space complexity