Why do we use the term asymptotic in complexity. Although I know what an asymptote is, but what is an asymptote doing here?
Why are Complexity Notations Called Asymptotic?
complexity theory;algorithm analysis;terminology;landau notation;notation
There are several answers to this.Asymptotic here means as something tends to infinity. It has indeed nothing to do with curves.There is no such thing as complexity notation. We denote complexities using asymptotic notation, more specifically Landau notataion.Complexity is a mostly empty, overused and overloaded term. However, in the context of algorithms in TCS, it is usally agreed uponthat it means the $\Theta$-class (also order of growth) of the worst-case running-time cost function of a given algorithm.Similarly the complexity of a problem means the best worst-case complexity among all algorithms for this problem.These can be overridden by adding qualifiers, e.g. average-case space complexity.Note that item 3 is my own opinion; some people disagree. You will indeed find complexity used for many things in the literature and on this site. In case of doubt or ambiguity, ask the author.