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 quantifies the execution time of an algorithm in relation to the input size.
Step 2: Distinguish from related concepts.
- Process time: A general, informal descriptor.
- Time period: Pertains to cycles in physics and electronics, not algorithmic analysis.
- Time bound: Relates to deadlines, not computational performance.

Step 3: Proper Terminology.
The accurate term is Time Complexity.
Final Answer: \[\boxed{\text{Time Complexity}}\]