Question
Which data structure or concept is best described as an asymptotic upper bound on growth rate?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Big-O Notation
Explanation:
Big-O Notation is an asymptotic upper bound on growth rate.
This description distinguishes it from the other choices.
Leave a Reply