作者fj90406 (阿亮)
看板Grad-ProbAsk
標題[理工] [計組]-divide and conquer method
時間Sun Mar 21 10:04:53 2010
(a) Explain the three phases of the divide-and-conquer method used in
designing algorithms.
(b) The recurrence equation, T(n)=aT(n/b)+f(n), can be used to analyze
the complexity of divide-and-conquer method. Explain the following:
(1) the role of the function f(n), and
(2) the restriction on b, and why we need such a restriction.
題目意思就不太了解了,什麼是divide-and-conquer??
願有大大解惑!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.68.184.217
推 soldier723:將一個大問題,切割成許多小問題 03/21 10:37
→ soldier723:將這些小問題解決之後,原本的大問題也就解決了 03/21 10:38