Asymptotic complexity
A kind of computational complexity that
emphasizes the order of growth
as the input size tends to infinity by
ignoring constant factors and lower-order terms.
A kind of computational complexity that
emphasizes the order of growth
as the input size tends to infinity by
ignoring constant factors and lower-order terms.