400 views
1 votes
1 votes
Which grows faster when n increases?

$I. n^{\frac{1}{3}}<\frac{n}{logn}

II. n^{\frac{1}{3}}>\frac{n}{logn}$

Please log in or register to answer this question.

Related questions

4 votes
4 votes
3 answers
1
radha gogia asked Nov 22, 2015
856 views
According to me $n^3$ should be asymptotically greater since $(\log n)!$ is computed like $\log n$ will be a small constant less than $n$ and when I calculate its factori...
0 votes
0 votes
2 answers
3
sh!va asked Jun 16, 2016
511 views
Merge sorting has the minimum worst case complexity.. LikewiseWhich sorting algorithm has largest best case complexity?
1 votes
1 votes
0 answers
4
Mayankprakash asked Sep 7, 2018
340 views
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions?Please suggest on above point.