Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Analysis of Algorithms | Question 13

Improve Article
Save Article
Like Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article
Like Article

Consider the following functions:

  f(n)   = 2n
  g(n)   = n!
  h(n)   = nlog(n)

Which of the following statements about the asymptotic behavior of f(n), g(n), and h(n) is true?
(A) f(n) = O(g(n)); g(n) = O(h(n))
(B) f(n) = \\Omega  (g(n)); g(n) = O(h(n))
(C) g(n) = O(f(n)); h(n) = O(f(n))
(D) h(n) = O(f(n)); g(n) = \\Omega  (f(n))









Answer: (D)


According to the order of growth: h(n) < f(n) < g(n) (g(n) is asymptotically greater than f(n) and f(n) is asymptotically greater than h(n) ) We can easily see above order by taking logs of the given 3 functions

   log(n*log(n)) < n < log(n!)  (logs of the given f(n), g(n) and h(n)).

Note that log(n!) = \\theta  (nlogn)

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Like Article
Save Article
Related Articles

Start Your Coding Journey Now!