70 962
Assignments Done
98,9%
Successfully Done
In March 2019

Answer to Question #85285 in Algorithms for Mlk

Question #85285
Prove that n + log2n = O(n) by showing that there exists a constant c > 0 such that n + log2n ≤ cn.
(note that log2n means (log n)2.)
Expert's answer
@$(\log^2⁡n-n)'=2 \log ⁡n \times 1/n-1=2 ((\log ⁡n-n))/n\le0,\quad n\in\mathbb{N}@$@$(\log ⁡n-n)'=1/n-1\le0@$@$\log^2 n \le n @$@$n + \log^2 n \le n + n = 2n,\quad n\in \mathbb{N}@$

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions