This algorithm Big O is true or false and why?

Asked Aug 23 '17 at 03:00

Active Aug 23 '17 at 07:15

Viewed 31 times

I have a doubt with this affirmation, I like to know if is true or false and why $$\log(n) ∈ O(n^{1/2})$$

edited Aug 23 '17 at 07:15

fade2black

asked Aug 23 '17 at 03:00

antony_morar

1

This is true but requires proof. It's a nice exercise. – Yuval Filmus Aug 23 '17 at 07:22
Check out CLRS 3ed page 57. – ryan Aug 23 '17 at 13:35

0 Answers0