目錄
緒論
緒論
g座112 [email protected]
分治，減治法，變治法，transform
divide and conquer的核心：merge部分對計算量的節省
dynamic programming：trade memory for speed,具有交疊子問題的良藥
approximation algorithms: trade accuracyf for speed
randomized algorithm: trade certainty for speed