Dynamic Programming

Compare to Greedy and Divide_and_conquer Greedy. Build up a solution incrementally, myopically optimizing some local criterion. Divide-and-conquer. Break up a problem into sub-problem into sub-problem
相關文章
相關標籤/搜索