Asymptotic Notations (a) Which one of the following is a wrong statement? 1. O(n) + O(n) = O(n) 2. O(n) + O(n) = O(n) 3. O(n) + O(n) = O(n) 4. f(n) = o(g(n)) implies g(n) = O(n) (b) Use the basic definition of O-notation to show n^2 - 100n log10 n = O(n^2):
Added by Danny H.
Step 1
(a) Show more…
Show all steps
Your feedback will help us improve your experience
Tarandeep Singh and 68 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of the following asymptotic notations is the worst among all? (a) O(n+9378) (b) O(n^3) (c) O(1) (d) O(2n)
Aarya B.
The following problems deal with another type of asymptotic notation, called little-o notation. Because little-o notation is based on the concept of limits, a knowledge of calculus is needed for these problems. We say that $f(x)$ is $o(g(x))$ [read $f(x)$ is "little-oh" of $g(x) ]$ , when $$\lim _{x \rightarrow \infty} \frac{f(x)}{g(x)}=0$$ (Requires calculus) Show that a) $x^{2}$ is $o\left(x^{3}\right)$ b) $x \log x$ is $o\left(x^{2}\right)$ c) $x^{2}$ is $o\left(2^{x}\right)$ d) $x^{2}+x+1$ is not $o\left(x^{2}\right)$
Algorithms
The Growth of Functions
Sri K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD