For each of the following pairs of functions f(n) and g(n), either f(n) = O(g(n)) or g(n) = O(f(n)), but not both. Determine which is the case

Question

there is 2 functions: f(n) = n + log n and g(n) = n√n

n + log n <= C * n√n

n√n <= C(n + log n)

stuck to prove that

try to prove that n*sqrt(n) grows faster than both n and log n. — Christian Sloper, Jun 21 '21 at 09:57
I’m voting to close this question because it is not about programming as defined in the [help] pages. — AdrianHHH, Jun 21 '21 at 20:42

score 0 · Accepted Answer · answered Jun 21 '21 at 10:03

0

To prove

n + log(n) <= C*n*sqrt(n)

divide by n to get

1 + log(n)/n <= C*sqrt(n)

As log(n)/n goes towards zero when n goes towards infinity, you get

1 <= C*sqrt(n) for n -> infinity

which is true.

answered Jun 21 '21 at 10:03

Support Ukraine