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 worse than the best possible algorithm.

More at Wikipedia

Element uniqueness problem

Asymptotic computational complexity

Analysis of algorithms