The worst case complexity function f(n)of an algorithm
A) is the maximum execution time measured when a program with n inputs is executed
B) occurs when the load on the system is heaviest
C) is always harder to compute than the average case complexity
D) is the maximum number of basic steps performed in solving a problem instance with input size n

Question

Quizplus · Accepted Answer

The worst case complexity function f(n) of an algorithm is the maximum number of basic steps performed in solving a problem instance with input size n. This means that in the worst case scenario, the algorithm takes the maximum amount of time to complete. Option A is incorrect because it mentions execution time, which can vary depending on the system and environment. Option B is incorrect as load on the system is not related to the worst case complexity of the algorithm. Option C is incorrect as the average case complexity of an algorithm may be harder to compute than the worst case complexity.

The Worst Case Complexity Function F(n)of an Algorithm