Table 4 θ values indicate the degree of complexity of each application’s algorithm
The degree of complexity of the algorithm(θ) | The amount of impact factor |
|---|---|
\(n!\) | 0.9 |
\(2^{n}\) | 0.8 |
\(n^{2} \log n\) | 0.7 |
\(n^{2}\) | 0.6 |
\(n\log n\) | 0.5 |
\(n\) | 0.4 |
\(\log n\) | 0.3 |
\(c\) | 0.1 |