# 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.)

(note that log2n means (log n)2.)

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment