ann*_*nna 1 algorithm tree recursion big-o time-complexity
我有一个递归算法。不使用记忆，这是我的递归关系。如何计算时间复杂度？
小智 7
T(2) = T(1)
T(3) = T(2) + T(1) = T(1) + T(1) = 2*T(1)
T(4) = T(3) + T(2) + T(1) = 2*T(1) + T(1) + T(1) = 4*T(1)
T(5) = T(4) + T(3) + T(2) + T(1) = 4*T(1) + 2*T(1) + T(1) + T(1) = 8 *T(1)
...
T(n) = 2 (n-2) *T(1)