2019-02-19T12:50:58-05:00
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.)
1
2019-02-22T05:38:07-0500
( log 2 n − n ) ′ = 2 log n × 1 / n − 1 = 2 ( ( log n − n ) ) / n ≤ 0 , n ∈ N (\log^2n-n)'=2 \log n \times 1/n-1=2 ((\log n-n))/n\le0,\quad n\in\mathbb{N} ( log 2 n − n ) ′ = 2 log n × 1/ n − 1 = 2 (( log n − n )) / n ≤ 0 , n ∈ N ( log n − n ) ′ = 1 / n − 1 ≤ 0 (\log n-n)'=1/n-1\le0 ( log n − n ) ′ = 1/ n − 1 ≤ 0 log 2 n ≤ n \log^2 n \le n log 2 n ≤ n n + log 2 n ≤ n + n = 2 n , n ∈ N n + \log^2 n \le n + n = 2n,\quad n\in \mathbb{N} n + log 2 n ≤ n + n = 2 n , n ∈ 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 !
Learn more about our help with Assignments:
Algorithms
Comments