Big O notation question
What is the upper bound for the function f(n)=2n³-2n².
2n³ - 2n² <= 2n³ , for all n >= 1 O(f(n)) = O(2n³) = O(n³) Am I missing anything else?
It has cubic time/space complexity. Not sure if that was the question.
As the condition is 0<=f(n)<=g(n)
Yes you are correct for all n>=1 and c=2
Yes I know the answer but someone was contradicting this so I just want to confirm this
Thank you very much