retagged by
691 views

1 Answer

Best answer
4 4 votes

We can analyze these functions by performing Log on both sides of the equeations. ( a relative comparision when n->$\infty$ )

1. $\log f_{1} = \log (n!) = O(n\log n)$

2. $\log f_{2} = \log (2n^{2}+n\log n) = O(\log n)$

3. $\log f_{3} = \log (n^{2^{n}} + 6*2^{n}) = O(2^{n}\log n)$

comparing all these we find that $f_{3}$ is the biggest function. and $f_{2}$ is the smallest.
or $f_{2} < f_{1} < f_{3}$
=> (A) is False.

selected by
Answer:
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.4k
1.4k views
Registered user 7 asked Feb 3, 2016
1,354 views
Consider the following functions: $f(n)=3n^{\sqrt(n) }$ $g(n) =2^{\sqrt(n)}\log_2 n$ $h(n)=n!$Which of the following option is true?(A) $f(n)$ is $O(g(n...
0 0 votes
1 1 answer
864
864 views
iita asked Dec 16, 2016
864 views
2 2 votes
1 1 answer
488
488 views
0 0 votes
0 0 answers
584
584 views
Neelu Lalchandani asked Nov 2, 2022
584 views
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?