Ask
your own question, for FREE!
Computer Science
5 Online
i'm trying to determine if n^1/2 logn^1/2 is O(n). where do i start?
Still Need Help?
Join the QuestionCove community and study together with friends!
use basic Big O notation: f(n) = O g(n) if and only if \[0\le f(n)\le c1 g(n) \] where c1 is an arbitrary constant.
here, \[f(n)=n ^{\frac{ 1 }{ 2 }}\log n ^{\frac{ 1 }{ 2 }}\] and g(n)=O(n). now find some constant c1 which fits the above equation if it exists then you can say that f(n)=O g(n) otherwise not.
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