Groups
Sign in
Groups
黃子嘉 - 線代離散研究室
Conversations
About
Send feedback
Help
Recusion Tree推導
627 views
Skip to first unread message
林聖晏
unread,
Apr 4, 2022, 1:32:15 PM
4/4/22
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to 黃子嘉 - 線代離散研究室
老師您好 :
我最近遇到題目為 T(n) = 2T(2/n)+系塔(1) if n > 2;T(n) = 1 if n = 2 . 如果用演算法講義上1.2的Recusion Tree method,由於2*1/2 => r = 1,因此根據case2猜測T(n) =
系塔(1*logn) = 系塔*(logn),但這會和我們直接透過Recusion Tree 推導出的系塔(n)相左。因此想請問該如何解決此題呢?非常感謝
Reply all
Reply to author
Forward
0 new messages