While trying to write down a compact form of the following complexity expression
$ f = O(g) \space \space \space and \space \space f = \Omega(h)$
I was wondering if one can write the complexity approximation with inequalities as follows:
$ \Omega(h) \leqslant f \leqslant O(g)$
I have never seen these with inequalities thus I am not sure if this is not weird or incorrect.