If I have the runtime of: $$T(n)= \frac{27}{7} n^2− \frac{20}{7} 2^{\log_3(n)}$$
Is it correct that its Big-$O$ Notation is $2^n$?
Because what puzzles me is that while $n^2$ runs slower than $2^n$, by the log, indeed $2^{\log}...$ should run slower?
2026-04-25 05:22:13.1777094533
What is the runtime of $T(n)= \frac{27}{7} n^2− \frac{20}{7} 2^{\log_3(n)}$ using Big-$O$ notation?
63 Views Asked by user1187162 https://math.techqa.club/user/user1187162/detail At
1
Hint: Remember that $e^{\log(n)}=n$, see if you can use this to your advantage