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

看板Grad-ProbAsk作者 (MrEric)時間15年前 (2010/03/25 14:08), 編輯推噓2(2推 0噓 5→)
留言7則, 5人參與, 最新討論串1/1
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
推
03/25 14:22, , 1F
(logn)^2 ?
03/25 14:22, 1F
→
03/25 15:19, , 2F
我手邊也沒有答案哩 :(
03/25 15:19, 2F
推
03/25 15:24, , 3F
用Master Theorem解 O(lg n^2)
03/25 15:24, 3F
→
03/25 17:53, , 4F
K大..他是解遞迴，不是解複雜度耶@@"
03/25 17:53, 4F
→
03/25 18:25, , 5F
<1> 若那個是 log(n^2) , 則 T(n)= log(n)[log(n)+1] - 1
03/25 18:25, 5F
→
03/25 18:25, , 6F
<2> 若是指 [log(n)]^2 , 則
03/25 18:25, 6F
→
03/25 18:26, , 7F
T(n) = [log(n)][log(n)+1][2log(n)+1]/6
03/25 18:26, 7F
‣ 更多 bigrat2 的文章
文章代碼(AID): #1BgltOqU (Grad-ProbAsk)