Article Directory
Calculation model
| classification | the difference |
|---|---|
| Turing machine model | Like the same access list |
| RAM model | Like an array access |
mark
Mathematics limits of representation
| significance | mark |
|---|---|
| Upper Bound | O(f(n)) |
| Lower bound | O (f (n) |
| Infimum | Th (f (n) |
Complexity common conclusion
n^c
任意c>0,log(n)=O(n^c)
2^n
Gordian
任意c>1,n^c=O(2^n)
