Algorithms | Analysis of Algorithms | Question 4

Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE?
(A) 
(B) 
(C) 
(D) 

(A)

A

(B)

B

(C)

C

(D)

D

Answer: (C)

Explanation:

The worst case time complexity is always greater than or same as the average case time complexity.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save