The evaluation of an algorithm’s performance and efficiency is known as asymptotic analysis. The correct response would be asymptotic analysis (though it seems there might be a typo in your options as it says "asymptomatic"). This analysis typically involves determining the algorithm's performance in terms of time and space as the input size grows towards infinity.
What is the evaluation of an algorithm’s performance and efficiency known as?(1 point)
Responses
hash table
hash table
solution costs
solution costs
basic operations
basic operations
asymptomatic analysis
1 answer
1 answer