討論串[理工] 演算法 時間複雜度
共 7 篇文章
內容預覽:
Cormen ch4-4 b. T(n) = 5T(n/5) + n/lg n. 我的解法:. T(n) = 5T(n/5) + n/lg n. = 25T(n/25) + 5*(n/5)/lg (n/5) + n/lg n. i=lg n. =5^i*T(n/5^i) + Σ [ n/(lg n
(還有98個字)
內容預覽:
洪捷1-9 98年交大資工. We abuse the "+" operator with the asymptotic notations. For example, we may say that the total time for an algorithm is O(n)+θ(n). Whi
(還有166個字)