Posts by thaismota17 • 31 points
1 post
-
3
votes1
answer576
viewsQ: Algorithm complexity - Big O notation
The function f(n) = n3 + 2 asymptotically dominates the function g(n) = 200n2 + 5, for a value of n large enough. That is to say, g(n) is O(f(n)) How can I prove that statement is true?…
asked thaismota17 31