資料結構›Ch1 演算法基礎
第 44 題/共 57 題
◀ DS 44/57
44. Master Theorem、漸進符號
#DS-01-044中Master Theorem漸進符號

(15%) Use the master method to give tight asymptotic bounds for the following recurrences. If the master method does not apply, you should point out and explain.

(1) (3%) T(n)=2T(n/4)+nT(n) = 2T(n/4) + \sqrt{n}

(2) (3%) T(n)=T(n−1)+nlg⁡nT(n) = T(n-1) + n\lg n

(3) (3%) T(n)=3T(n/4)+nlg⁡nT(n) = 3T(n/4) + n\lg n

(4) (3%) T(n)=4T(n/2)+n2lg⁡nT(n) = 4T(n/2) + n^2\lg n

(5) (3%) T(n)=7T(n/2)+Θ(n2)T(n) = 7T(n/2) + \Theta(n^2)

📄 成大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch1 演算法基礎
本章題號 · 41–57 / 57