3 ms·
In computer science it's used to express asymptotic behaviour. This suppresses lower-order terms and constant factors, so O(2n + log(n)) = O(n). The most common
by lorenzhs 10y ago
In computer science it's used to express asymptotic behaviour. This suppresses lower-order terms and constant factors, so O(2n + log(n)) = O(n). The most common ones used are upper bounds O(•), asymptotically equal behaviour θ(•), and lower bounds Ω(•).