PA of Algorithms Q56

0. Consider the following functions:
f(n) = 2n
g(n) = n!
h(n) = nlogn
which of the following statements about the asymptotic behaviour of f(n), g(n), and h(n) is true?

  • Option : D
  • Explanation : f(n) = 2n g(n) = n! ≅ nn h(n) = nlogn for larger value of n g(n) > f(n) > h(n) so we can conclude that f(n) = O(g(n)) or g(n) = Ω(f(n)) and h(n)= Of(n).
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *