Big O notation is denoted with $$\bigo{g(n)}$$ and indicates an worst-case asymptotic upper bound. While $$2n^2$$ is in $$\bigo{n^9}$$, it’s preferred to be as precise as possible and state the lowest valid case: $$2n^2 = \bigo{n^2}$$.