On the question Big O Notation "is element of" or "is equal" it is said that
Example: you have two functions $n↦f(n)=n^3$ and $n↦g(n)=n^2$
Obviously f is asymptotically faster than g. [...] $f(n)∈O(g(n))$
Why is it "faster" and not "slower"?
I am kind of familiar to the Big $O$ notation for algorithms, but not for functions, and I am used to say that $O(n^3)$ is slower than $O(n^2)$, asymptotically.
Note: I believe that the OP said "slower", but somebody edited it to "faster".