Confirm the answer to compute the asymptotic solution to the problem

29 Views Asked by At

I have the following problem enter image description here

enter image description here

The solution I derived is $O(g(n))$ where $C = 1, n > 1$. Is this solution correct ?

1

There are 1 best solutions below

0
On

No. Hint: Your solution ($\sqrt(n) = O(log(n + 3))$ in verbose means that $\sqrt(n)$ grows as most as fast as $log(n + 3)$ $\forall n > 1$