Is there such a thing as an algorithm that runs in asymptotic time? For example: $O(-e^{-x} +1)$. Basically as the size of the input increases, the time it takes to run converges.
It is not hard to see that $O(-e^{-x} +1) = O(1)$.