Answer:
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.
Explanation:
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.
If you need more tests related to Computer Science Engineering, go through the course
HOPE THIS HELPS>>>