M****J
发帖数: 2908 | 1 求 T(n)=2T(n/2)+n/((logn)^2) 之 O( )
...
...
答:O(n), Why?, How?
---------------
类似 SUM(k/((logk)^2)) = O(n) | W**********U
发帖数: 132 | 2 First, build a tree.
Next, sum up the cost at each level and use the fact that 1 + 1/2^2 + 1/3^2
+ ... < 2
It is indeed O(n)
【在 M****J 的大作中提到】
: 求 T(n)=2T(n/2)+n/((logn)^2) 之 O( )
: ...
: ...
: 答:O(n), Why?, How?
: ---------------
: 类似 SUM(k/((logk)^2)) = O(n)
|
|
