1 1 vote Algorithms algorithms asymptotic-notations ace-test-series + – harkirat31 691 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
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. dd answered Aug 10, 2016 • selected Aug 11, 2016 by harkirat31 dd comment Share Follow See 1 comment 1 1 comment reply dd commented Aug 12, 2016 reply Follow flag PS: this log comparision does not always work . we have to be little careful while applying this. 1 1 replyShare Please log in or register to add a comment.