Little Oh Complexity

Little Oh Complexity is used to state that a certain function grows slower than the other

i.e

$$\begin{array}{c}f(n)=n^3\\ g(n)=n^4\\ \\ \underset{n\to \infty }{\lim }\frac{f(n)}{g(n)}=0\\ \therefore f(n)=o(g(n))\end{array}$$