t******r
发帖数: 209 | 1 E(i=1,n-1)(T(n) - T(i) = O(n^2)?
T(1) = 0 and T(2) = 1.
thank you so much | l******n
发帖数: 9344 | 2 ???
【在 t******r 的大作中提到】
: E(i=1,n-1)(T(n) - T(i) = O(n^2)?
: T(1) = 0 and T(2) = 1.
: thank you so much
| t******r
发帖数: 209 | 3 Here is recurrence deduction:
if
sum(T(n)-T(i)) = O(n^2) (1
and T(1) = 0 and T(2) = 1,
how to deduce the tightest upperbound of T(n)?
【在 t******r 的大作中提到】
: E(i=1,n-1)(T(n) - T(i) = O(n^2)?
: T(1) = 0 and T(2) = 1.
: thank you so much
|
|
