 Open in App
Not now

# Difference between Greedy Algorithm and Divide and Conquer Algorithm

• Difficulty Level : Basic
• Last Updated : 04 Nov, 2022

## Divide and conquer Algorithm:

Divide and Conquer is an algorithmic paradigm in which the problem is solved using the Divide, Conquer, and Combine strategy.

A typical Divide and Conquer algorithm solves a problem using the following three steps:

• Divide: This involves dividing the problem into smaller sub-problems.
• Conquer: Solve sub-problems by calling recursively until solved.
• Combine: Combine the sub-problems to get the final solution of the whole problem.

## Greedy Algorithm:

Greedy algorithm is defined as a method for solving optimization problems by taking decisions that result in the most evident and immediate benefit irrespective of the final outcome. It is a simple, intuitive algorithm that is used in optimization problems.

## Difference between the Greedy Algorithm and the Divide and Conquer Algorithm:

My Personal Notes arrow_drop_up