Register

Doubt : Made Easy OTS

• retagged by
280 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

633
views
2 answers
0 votes
snaily16 asked Jan 9, 2019
633 views
made easy test
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?
User Avatar
1.0k
views
1 answers
1 votes
Hira Thakur asked Aug 14, 2016
1,008 views
#made easy
Big oh estimate forf(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as1.O(xlogx)2.O($x^2$)3.O($x^3$)4O($x^2$logx)
User Avatar
1.4k
views
2 answers
0 votes
srestha asked May 6, 2019
1,446 views
Made Easy Test Series:Algo- Asymptotic Complexity
$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?
User Avatar
420
views
0 answers
1 votes
shweta sah asked Dec 2, 2018
420 views
Made easy test series
Order the following: $\frac{e^{n \log n}}{n}, 2^{n \log n}, n^{\sqrt n}$
User Avatar
Link Copied!