![]() Solution using divide and conquer is simple. More efficient due to the saving of solution. It splits input at each and every possible point. Solutions of sub problems are stored in the table. Solutions of sub problems are not stored. Sub problems of dynamic programming are dependent and overlapping. In divide and conquer, sub problems are independent. In following table, we have compared both the problem solving approaches Divide and Conquerĭivide and conquer is the top down approach.ĭynamic programming is bottom up approach. So there won’t be any repetition of work in the case of dynamic programming. ![]() ![]() Dynamic programming stores the solutions to all sub problems in table, and when ever same sub problem is encountered again, it does not solve it but picks the solution from the table. Due to independent sub problems, divide and conquer solves similar sub problems multiple times.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |