PA of Algorithms Q63

63Let 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?

Option : C
Explanation :
If B(n), XXA(n) and W(n) denote best case, average case and worst case time complexities of an algorithm P respectively then B(n) = O(A(n)), A(n) = O(W(n))

Forgot your password?

I agree with the Terms.