The Success Center Mithi

Which data-structure or algorithm term matches this description: linear complexity that grows roughly in proportion to input size?

A) O(log n)

B) Array

C) O(n)

D) Push

Answer: C

Explanation: O(n): linear complexity that grows roughly in proportion to input size. This is the defining idea tested by the question.

Scroll to Top