## Divide and conquer algorithm

Divide and conquer algorithm divides problems into smaller subproblems , solve the subproblems and combine the solutions to find the solution of the main problem. Letâ€™s see an example .

Divide and conquer algorithm divides problems into smaller subproblems , solve the subproblems and combine the solutions to find the solution of the main problem. Letâ€™s see an example .

Greedy algorithms always find for optimal solution of a problem by following greedy approach. This solution may require minimum or maximum result. There will be some feasible solutions for the problem and this algorithm will find the optimal one.