+ 3

# Big O notation question

What is the upper bound for the function f(n)=2n³-2n².

6 Answers

+ 6

2n³ - 2n² <= 2n³ , for all n >= 1
O(f(n)) = O(2n³) = O(n³)
Am I missing anything else?

+ 4

It has cubic time/space complexity. Not sure if that was the question.

+ 1

As the condition is 0<=f(n)<=g(n)

+ 1

Yes you are correct for all n>=1 and c=2

0

Yes I know the answer but someone was contradicting this so I just want to confirm this

0

Thank you very much