in Algorithms
354 views
0 votes
0 votes
f(n)=$2^n$

g(n)=n!

h(n)=$n^{logn}$
 

which one is true?

A) f(n)=O(g(n)) and g(n)=O(h(n))

B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n))
C) g(n)=O(f(n)) and h(n)=O(f(n))

D) h(n)=O(f(n)) and g(n)=$\Omega(f(n))$
in Algorithms
by
354 views

4 Comments

pls give a detailed solution. i'm unable to understand
0
0
Take two functions at a time, compare them by taking log and draw conclusion from them.

You will get f(n)<g(n), h(n)<g(n) and h(n)<f(n) . So, the answer is (d).
0
0

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
aditi19 asked in Algorithms Nov 4, 2018
815 views
aditi19 asked in Algorithms Nov 4, 2018
by aditi19
815 views