Question
NCRE Level 4 system-design analysis 40: Which claim about algorithm complexity is supported by the underlying concept? Focus on programming in this variation.
Select an option. Your answer will be checked instantly.
Correct Answer: C. Big-O notation describes how resource use grows with input size
Explanation:
Asymptotic notation characterises growth rates rather than exact machine-specific time.
Leave a Reply