answersLogoWhite

0


Best Answer

greedy method does not give best solution always.but divide and conquer gives the best optimal solution only(for example:quick sort is the best sort).greedy method gives feasible solutions,they need not be optimal at all.divide and conquer and dynamic programming are techniques.

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the difference between greedy algorithm and Divide and Conquer?
Write your answer...
Submit
Still have questions?
magnify glass
imp