Ask
your own question, for FREE!
Computer Science
5 Online
Why is the Big O of 5N(log2 N) + N x sqrt(N) equals to O(N^1.5)?
Still Need Help?
Join the QuestionCove community and study together with friends!
I'm just learning Big O notation myself now so this is my interpretation 5N(log2 N) + N x sqrt(N) = 5N(log2 N) + (N x N^0.5) 5N(log2 N) + N^1.5 BigO of the above should take the term which will grow the largest as n approaches infinity and that will be N^1.5 therefore your answer O(N^1.5).
\[O(an ^{x} + bn ^{y} + cn ^{z}) = O(an ^{x}) = O(n ^{x}) \] for x>y>z
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
DoltonCarlee:
what are y'all's options on S A T essays because honestly their not that bad
thereneelg:
Can someone give me a summary of article 231, The war guilt clause?? I need to explain what it is, but I can't find any shortened version of what it is and
luisaam2:
What should you do when the person you want to talk to the most is the one making
Breathless:
https://medal.tv/games/roblox/clips/nAYivIl6oXB6q9QAI?invite=cr-MSxCSk4sMTY4OTA4N
Twaylor:
I'm not that good at law can someone fact check this without bias? June 29, 2026, the Supreme Court decided Chatrie v.
Demon25:
For a hoco proposal with a cheerleader and football player, what else should be a
1 day ago
4 Replies
2 Medals
2 days ago
7 Replies
1 Medal
1 day ago
16 Replies
1 Medal
1 week ago
0 Replies
0 Medals
1 week ago
0 Replies
0 Medals
1 week ago
12 Replies
0 Medals