little-o notation

$f(n)=o(g(n))$

Some constant can make $g(n)$ greater than $f(n)$ for big enough $n$, i.e. $f(n)$ grows slower than $g(n)$.