The Gateway to Computer Science Excellence
+1 vote

in Algorithms by (467 points) | 92 views

1 Answer

+4 votes
Best answer

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.

by Veteran (57.2k points)
selected by
PS: this log comparision does not always work . we have to be little careful while applying this.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
104,920 users