WH LogoWH·CSBank
資料結構›Ch1 演算法基礎
第 48 題／共 57 題
◀ DS 48/57
48. Recurrence Relations、Master Theorem
#DS-01-048中Recurrence RelationsMaster Theorem

Assume that the function value of each of the following functions is constant for n≤2n \le 2.

t(n)=n+∑k=1n−1[t(k)+t(n−k)],f(n)=2f(n/4)+n,t(n) = n + \sum_{k=1}^{n-1}[t(k) + t(n-k)], \qquad f(n) = 2f(n/4) + \sqrt{n}, g(n)=g(n/2)+n,h(n)=5h(n/2)+(nlg⁡n)2,a(n)=a(n−1)+nklg⁡n.g(n) = g(n/2) + \sqrt{n}, \qquad h(n) = 5h(n/2) + (n \lg n)^2, \qquad a(n) = a(n-1) + n^k \lg n.

Choose the correct answers.

📄 中央113
跳轉到第題
← 上一題下一題 →
▤完整推導請見《WH 資工筆記 · 資料結構》Ch1 演算法基礎
本章題號 · 41–57 / 57
4142434445464748495051525354555657