❗ Based on Discrete Structures, Find O(x^2)
Did not know where else to post this....
Show that f(x) = x2 + 2x + 1 is O(x2 ).
O is Big-O Notation. I do not understand parts of it. Basically retrieving Positive Constant 'C' and 'k' (the Witnesses).
And to find >> |f(x)| <= C |g(x)| whenever x > k.
If anyone is able to understand and knows this, please show in steps how you came to the result.
Thanks A lot.
Show that f(x) = x2 + 2x + 1 is O(x2 ).
O is Big-O Notation. I do not understand parts of it. Basically retrieving Positive Constant 'C' and 'k' (the Witnesses).
And to find >> |f(x)| <= C |g(x)| whenever x > k.
If anyone is able to understand and knows this, please show in steps how you came to the result.
Thanks A lot.
