Definition: The ASYMPTOTIC efficiency of an algorithm is the order of growth of the algorithm as the input size approaches the limit (increases without bound).
The asymptotically more efficient algorithm is usually the better choice for all but small inputs.