Which of the following best describes 'Big O notation'?
A
A programming language
B
A way to express the efficiency or complexity of an algorithm
C
A network protocol
D
A type of database index
Correct Answer: Option B — A way to express the efficiency or complexity of an algorithm
Explanation:
Big O notation is a mathematical notation used to describe the upper bound of an algorithm's time or space complexity as the input size grows. It helps developers compare the efficiency of different algorithms in a standardized way.