Asymptotically optimal algorithm

In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than any possible algorithm. It is a term commonly encountered in computer science research as a result of widespread use of big O notation.