Skip to content
Related Articles

Related Articles

Improve Article
Algorithms | Analysis of Algorithms | Question 4
  • Difficulty Level : Hard
  • Last Updated : 06 Feb, 2013

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? (GATE CS 2012)
(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.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :