Q18

MCQ1 mark, −0.33

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)

$A(n) = \Omega (W(n))$

(B)

$A(n) = \Theta (W(n))$

(C)

$A(n) = \text{O} (W(n))$

(D)

$A(n) = \text{o} (W(n))$

Loading…