Question
For the following function, prove it is in the givenBig(g(n)) by showing it is in both BigO(g(n)) and Big(g(n)). Provide a graph for both BigO
For the following function, prove it is in the givenBig(g(n)) by showing it is in both BigO(g(n)) and Big(g(n)). Provide a graph for both BigO and Big with the constants you chose. You may use any online graphing generator to create the graph. Make sure all functions are on the same graph including f(n).
Show that f(n)=14n2+11n is in (n2).
f(n) = 14n2 + 11n is in big((n2)
setting c = 15 and n0 = 1,
14n^2 + 11n <= 15 * n^2 for all n >= 1
f(n) = 14n2 + 11n is in BigO(n2)
all n >= n0, 14n2 + 11n >= c * n2
Setting c = 13 and n0 = 1,
14n^2 + 11n >= 13 * n^2 for all n >= 1
big(n2) contains f(n) = 14n2 + 11n
however, im not sure how to graph this
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started