|
算法
|
1
|
2
|
3
|
4
|
|
|
时间复杂度
|
\(O(N^3)\)
|
\(O(N^2)\)
|
\(O(N log^N)\)
|
\(O(N)\)
|
|
|
输入 规模 |
\(N=10\) | \(0.00103\) | \(0.00045\) | \(0.00066\) | \(0.00034\) |
| \(N=100\) | \(0.47015\) | \(0.01112\) | \(0.00486\) | \(0.00063\) | |
| \(N=1000\) | \(448.77\) | \(1.1233\) | \(0.05843\) | \(0.00333\) | |
| \(N=10000\) | \(NA\) | \(11.13\) | \(0.68631\) | \(0.03042\) | |
| \(N=100000\) | \(NA\) | \(NA\) | \(8.0113\) | \(0.29832\) | |