COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What does it mean when we say that an algorithm X is asymptotically more efficient than Y?
|
|
X will be a better choice for all inputs
|
|
|
X will be a better choice for all inputs except possibly small inputs
|
|
|
X will be a better choice for all inputs except possibly large inputs
|
|
|
Y will be a better choice for small inputs
|
Explanation:
Detailed explanation-1: -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.
Detailed explanation-2: -"Asymptotically more efficient” means “more efficient for all problems above a certain size".
Detailed explanation-3: -In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm.
There is 1 question to complete.