Is $n^3$ an asymtotically tight bound of $(n^{2.99}).(\log_2n)$? If so then how?
Asked
Active
Viewed 199 times
2 Answers
1
$g(n)$ is an asymptotically tight bound of $f(n)$ if $f(n) = O(g(n))$, but $f(n) ≠ o(g(n))$. In this case, $n^{2.99} \log n = o (n^3)$. For very large n, $n^{0.01}$ grows faster than $\log n$.
Yuval Filmus
- 280,205
- 27
- 317
- 514
gnasher729
- 32,238
- 36
- 56