Algorithms complexity / Growth of Functions
渐进记号
Asymptotic Notation
A way to describe the rate with which the running time of the algorithm increases compared to the rate at which the size of the problem () increases.
o-notation
- 的增长率小于
- 明确（准确计算）知道小于它
- For example, , but
O-notation
when we have only an asymptotic upper bound
💡 Always concerned with worst case(max) time requirement
的增长率小于等于
- 不确定是否等于时使用（近似复杂度）
Θ-notation
Ω-notation
when we have only an asymptotic lower bound
的增长率大于等于
ω-notation
- 的增长率大于