Use a recursion tree to determine a good asymptotic upper bound on the
recurrence T(n) = T(n-1) + T(n/2) + n.Use the substitution method to verify
your answer.
出自原文書
有人會嗎
http://stackoverflow.com/questions/14195011/a-better-guess-on-upper-bound
這個答案正確嗎~?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.114.234.39