All Questions
1
question
0
votes
1
answer
431
views
What's a better time complexity, $O(\log^2(n))$, or $O(n)$?
(By $O(\log^2(n))$, I mean $O((\log n)^2)$ rather than $O(\log(\log(n)) )$
I know $O(\log(n))$ is better than $O(\log^2(n))$ which itself is better than $O(\log^3(n))$ etc. But how do these compare to ...
