Answer to Question #85287 in Algorithms for Mlk

Programming & Computer Science>

Question #85287

Prove or disprove the following:  
1. lg√n ∈ O(lg n) (√n means square root of n) 
2. lg n ∈ O(lg√n)  
3. 2n+1 ∈ O(2n) 

Expert's answer

Download Answer

Learn more about our help with Assignments: Algorithms

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Prove the following using mathematical induction: 1. (ab)n = an bn for every natural number n
2. Prove that n + log2n = O(n) by showing that there exists a constant c > 0 such that n + log2n ≤
3. 1. Prove that n + log n = O(n) by showing that there exists a constant c > 0 such that n + log n
4. Find the time complexity of the following algorithms in terms of Big O. 1) Time Complexity of a lo
5. Find the time complexity of the following algorithms in terms of Big O. 1) A function (or set
6. Read 10 integers from the keyboard in the range 0 -100, and count how many of them are larger than 5
7. Design an algorithm to accept income from the user; compute the income tax to be paid and display th