retagged by
997 views
2 votes
2 votes

retagged by

1 Answer

Best answer
4 votes
4 votes

$1)$ $n^{\sqrt{n}}=2^{\sqrt{n}.logn}$

$2)$ $2^{n}$

$3)$ $n^{10}.2^{n/2}=2^{(10.logn+n/2)}$

$4)$ $\frac{n.(n+1)}{2}-1$


Last one is trivial so comparing the exponent part of first $3$.

$\Rightarrow \sqrt{n}logn$

$\Rightarrow n=\sqrt{n}.\sqrt{n}$


$\Rightarrow 10.logn+\frac{n}{2} \approx \frac{n}{2}=\frac{1}{2}(\sqrt{n}.\sqrt{n})$

$\therefore logn<\frac{\sqrt{n}}{2}<\sqrt{n}$

$\Rightarrow$ $1<3<2$


$\color{Red}{4<1<3<2}$

selected by

Related questions

0 votes
0 votes
1 answer
1
ankit_thawal asked Jan 30, 2018
249 views
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______How to solve such examples.Rules for math of asymptotic notations(mul,div,a...
0 votes
0 votes
2 answers
2
srestha asked May 6, 2019
1,287 views
$1)n^{2019}=O\left (n^{2020} \right )$$2)O(n^{2019})=O\left (n^{2020} \right )$Which one is correct??If $1)$ is correct, why $2)$ not correct?
0 votes
0 votes
2 answers
3
snaily16 asked Jan 9, 2019
588 views
Given below are 4 functions$999999n$$0.99999 n logn$$1.000001^{n}$$n^{2}$The increasing order of the above functions in terms of their asymptotic complexity is?
1 votes
1 votes
1 answer
4
Markzuck asked Jan 6, 2019
501 views
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?