Ask
your own question, for FREE!
Computer Science
13 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
heartlessprophet:
How do i get paid from work when im in job court ?
Aubree:
Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
thereneelg:
ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
kamariana:
The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
chuckD:
hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
DoltonCarlee:
So like do y'all know anything about the first world war?
thehearken:
anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
21 hours ago
0 Replies
0 Medals
1 hour ago
9 Replies
1 Medal
1 day ago
6 Replies
1 Medal
3 days ago
0 Replies
0 Medals
3 days ago
2 Replies
1 Medal
1 day ago
2 Replies
0 Medals
2 days ago
5 Replies
2 Medals