→ hwanger : 令S(n)=T(n)/n 則S(n)=S(√n)+1 令log(n)=m後 再用 10/29 00:49
→ hwanger : master theorem應該可以做 10/29 00:49
Give asymptotic upper and lower bound for T(n)=n^(1/2)T(n^(1/2))+n.
Assume that T(n) is constant for sufficiently small n.
Make your bounds as tight as possible.
再麻煩大家
p.s. 算是如果不清楚在 https://imgur.com/a/Sgxu61D
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 118.160.140.227 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Math/M.1603896319.A.1EE.html