Ask
your own question, for FREE!
Computer Science
10 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
VERNEISH:
Two objects are moving along separate linear paths where each path is described by position, d, and time, t.
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
6 hours ago
1 Reply
0 Medals
4 days ago
3 Replies
2 Medals
1 week ago
3 Replies
0 Medals
2 days ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal