Open In App

GATE | GATE CS 2012 | Question 18

Like Article
Like
Save
Share
Report
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) = O(W(n))
(D) A(n) = o(W(n))

(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. The term written in Big O notation can always asymptotically same or greater than the term on the other side.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads