- order of growth discards leading coefficient
- Formal Definition: if and only if there exist constants such that for all
- is the function of the running time of an algorithm.
- Warning cannot depend on n.
- [NOTE] It kinds of says, we use , but not
- Because will always less then (c is a constant, but n is not).
- And we need that, T(n) is bounded above by a constant multiple of f(n).
- asymptotic [,æsimp'tɔtik,-kəl] adj. 渐近的；渐近线的
- ubiquitous [ju:'bikwitəs] adj. 普遍存在的；无所不在的