- log(n!) ⇐> O(n log n)
- crypto: n^(log n); log n is the base
- small o is a more strict version of big O when doing <
- n/2 is in fact better than n
- For = stuff, we can use big-theta
- big-omega is >=
- little omega is >
- log is always the same (log 2 big omega log 3)