Difference between divide and conquer greedy method and dynamic programming in tabular form
Answers
Answered by
0
Answer -
- Dynamic programming approach is similar to divide and conquer in breaking down the problem into smaller and yet smaller possible sub-problems. But unlike, divide and conquer, these sub-problems are not solved independently. ... An optimum solution can be achieved by using an optimum solution of smaller sub-problems.
→ Hope it will help you ❣️❣️
→ Please mark as Breinliest ❤️❤️
Similar questions