Explain the similarity and difference between divide and conquer and
Greedy Algorithms?
Answers
Answered by
0
Explanation:
There are various ways available to solve any computer problem, but the mentioned are a good example of divide and conquer approach. An algorithm is designed to achieve optimum solution for a given problem. In greedy algorithm approach, decisions are made from the given solution domain.
Answered by
0
Hi sorry I don’t know answer for points I will say like this
Similar questions