I did max(logn , log((n^3) + 1) ) = O(log((n^3) +1)).
May I get verification is correct or not?
log(n^3) is a worser algorithm than logn because n^3 grows faster than n.
Asked
Active
Viewed 13 times
0
-
2You're missing the fact that $\log (n^3)=3\log n$. – David Richerby May 21 '15 at 12:20
-
1@DavidRicherby Which is worse than $\log n$. ;) (The question/answer is so vague that there is little to say about it.) – Raphael May 21 '15 at 12:46
-
@DavidRicherby Oh, dang it. I keep forgetting about that. Thanks! I see it now! – Nicholas May 21 '15 at 13:12