# Programming Algorithms Quiz

**What does it mean when we say that an algorithm X is asymptotically more efficient than Y?**

A. X will be a better choice for all inputs

B. X will be a better choice for all inputs except possibly small inputs

C. X will be a better choice for all inputs except possibly large inputs

D. Y will be a better choice for small inputs

# Solution :

B) is correct.

In asymptotic analysis we consider growth of algorithm in terms of input size. An algorithm X is said to be asymptotically better than Y if X takes smaller time than y for all input sizes n larger than a value n0 where n0 > 0.