The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
h5, I do not know the answers. check the pdf attached.
[40] Homework 5: Big O, Ω. [12] Select the best “big Oh” notation for each expression. Justify by showing the constants
c and n0 . Note that f (n) = O(g(n)) if there are constants c > 0 and n0 > 0 so that
for all n ≥ n0 we have |f (n)| ≤ c · g(n).
1. 100n2 + n.
2. (15n + log n)3 .
3. 3n5 − 5n2 − 100.
√
4. n2 log n + n + n + log n.
[6] Show the following: 5n2 − n log n = Θ(n2 )
n2
= O(n3 )
n log3 n + 1
√ [8] Justify that n log n + n is not O(n). [14] We say that f (n) ≺ g(n) if g(n) grows faster than f (n) (e.g., log n ≺ n).
Order the following functions by by ≺ from the lowest to the highest:
3
2 n Justify your answer. , 100, n2 log n, 2log2 n , log2 n, 22 log2 n , 2n .
-----------