165k views
1 vote
What does it mean when we say that an algorithm x is asymptotically more efficient than y?.

User Xni
by
8.0k points

1 Answer

3 votes

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>>>

User Gatsbyz
by
7.6k points