[理工] [資結]-輔大97

[bigrat2 (MrEric)]

solve the following recurrence relations for T(n) Assume that
n is a power of 2

T(n)= 1  if n=2
      T(n/2)+log n^2  if n>2
                2


拜託各位指導
謝謝

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 114.33.6.216
推 dendrobium: (logn)^2 ?
→ bigrat2:我手邊也沒有答案哩 :(
推 Kushanagi:用Master Theorem解 O(lg n^2)
→ swatch0811:K大..他是解遞迴，不是解複雜度耶@@"
→ doom8199:<1> 若那個是 log(n^2) , 則 T(n)= log(n)[log(n)+1] - 1
→ doom8199:<2> 若是指   [log(n)]^2 , 則
→ doom8199:   T(n) = [log(n)][log(n)+1][2log(n)+1]/6