The time complexity of an algorithm is determined by
2025
The time complexity of an algorithm is determined by
- A.
The number of inputs
- B.
The number of operations executed
- C.
The type of hardware
- D.
The type of programming language used
Attempted by 227 students.
Show answer & explanation
Correct answer: B
Time complexity measures how an algorithm's runtime grows relative to input size. It focuses on the dominant term in operation counts as input approaches infinity, typically expressed using Big O notation.