Greedy Algorithm: Build up a solution step by step, optimizing some local criteria in the short term.
Divide and conquer algorithm: decompose a problem into several sub-problems , solve each sub-problem independently and recursively , and combine the solutions of the sub-problems to form the solution of the original problem.
Dynamic Programming: Decomposes a problem into a series of overlapping problems and builds solutions to increasingly larger subproblems.
Compare the divide-and-conquer algorithm and the dynamic programming algorithm Divide-and-conquer VS. Dynamic programming
weighted interval scheduling
(138 messages) Chapter 15 of "Introduction to Algorithms"——Dynamic Programming Blog-CSDN Blog_Dynamic Programming