In computer science, Big O notation refers to which of the following?
- A. A measure of the amount of time an algorithm takes to run as a function of input size.
- B. A mathematical notation used to describe the upper bound of an algorithm's time or space complexity. ✓
- C. A graph traversal algorithm that explores all neighbors at the current depth before moving deeper.
- D. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
Correct answer
B. A mathematical notation used to describe the upper bound of an algorithm's time or space complexity.
Explanation
Big O notation refers to a mathematical notation used to describe the upper bound of an algorithm's time or space complexity.