Show that f(x) = x + 2x + 5x + 100 is O(x3). b) If f(n)...

Transcribed Image Text:

Show that f(x) = x³ + 2x² + 5x + 100 is O(x3). b) If f(n) = O(g(n)) then g(n) counter example. = O(f(n)). Is this true? If not, prove it with a c) What is the time-complexity of the following procedure in terms of big-O procedure increment_by(N: integer) i = 1 j = 1 sum = 0 while (i <= N) while (j <= N) begin sumsum + 1 i =i+1 := j = j+1 end Activate Go to Sett Show that f(x) = x³ + 2x² + 5x + 100 is O(x3). b) If f(n) = O(g(n)) then g(n) counter example. = O(f(n)). Is this true? If not, prove it with a c) What is the time-complexity of the following procedure in terms of big-O procedure increment_by(N: integer) i = 1 j = 1 sum = 0 while (i <= N) while (j <= N) begin sumsum + 1 i =i+1 := j = j+1 end Activate Go to Sett

Answer rating: 100% (QA)

a To show that fx x 2x 5x 100 is Ox3 we need to find a constant C and an x such that for all x x fx ... View the full answer