Comparison Between Greedy Method and Divide and Conquer

S.No	Greedy Method	Divide and Conquer
1)	By greedy method , there are some chance of getting an optimal solution to a specific problem	Divide and Conquer is the result oriented approach.
2)	The time taken by this algorithm is not that much efficient when compared to Divide and Conquer	The time taken by this algorithm is efficient when compared to greedy approach.
3)	This approach does not make further move, if the subset chosen does not satisfy the specified constraints.	This approach does not depend on constraints to solve a specific problem.
4)	This approach is applicable and as well as efficient for wide variety of problems.	This approach is not efficient for larger problems.
5)	Space requirement is less when compared to the Divide and Conquer	As the problem is divided into a large number of sub-problems, the space requirement is very much high.
6)	This approach is also applicable to problems which are not divisible.	This approach is not applicable to problems which are not divisible.
7)	Examples of this approach includes are Knapsack problem	Examples of this approach includes are Knapsack problem