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) = ? (W(n))||(B) A(n) = ? (W(n))|
|(C) A(n) = O (W(n))||(D) A(n) = o (W(n))|
Explain this Question