chapter01

复制本地路径 | 在线编辑

1. 复杂度递推式
1.1 证明T(n) = T(c) + T(n-c) + O(n) = O(n^2)
1.2 证明T(n) = T(c) + T(n-c-1) + O(1) = O(n)

Comments