Question

The amount of time an algorithm takes to process a given data can be called its:

• A. Process time
• B. Time period
• C. Time complexity
• D. Time bound

Hint:

Time complexity is usually expressed using Big-O notation (e.g., \(O(n), O(\log n)\)).

Answer 1

The Correct Option is C

Step 1: Definition.
Time complexity refers to the computational complexity that describes the amount of time it takes to run an algorithm as a function of the size of the input.
Step 2: Differentiate from other terms.
- Process time: Generic term, not a formal measure.
- Time period: Refers to cycles in physics/electronics, not algorithms.
- Time bound: Relates to deadlines, not algorithm analysis.

Step 3: Correct terminology.
The correct term is Time Complexity.
Final Answer: \[ \boxed{\text{Time Complexity}} \]