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

we consider the growth of the algorithm in terms of input size. I am not getting the concept properly.

CodePudding user response：

The growth of algorithm appears when we use containers such as Array,stack,queue and other data structures.If an array size is taken from the user then it will take O(N)(big-oh of N size) in terms of space complexity.

In terms of Time complexity, if there is any loop in the program running for n number of time then it will take O(N)(big-oh of N) time complexity.

These are the two main attributes while judging the growth of any algorithm.