Answer on Question #85287 - Programming & Computer Science - Algorithms
Question 85287:
Prove or disprove the following:
1. logn∈O(logn),(n means square root of n )
2. logn∈O(logn)
3. 2n+1∈O(2n)
Answer:
Def.: f(n)=O(g(n))⇔∃n0∈N,∃c≥0,∀n≥n0,∣f(n)∣≤c∗g(n)
1. ∣logn∣=∣1/2logn∣≤1∗logn,∀n∈N
2. ∣logn∣=∣2logn∣≤4∗logn,∀n∈N
3. ∣2n+1∣≤∣2n∣+∣1∣<4∗n,∀n∈N
Answer provided by https://www.assignmentexpert.com