Divide and Conquer Algorithm Design Technique

For Complete YouTube Video: Click Here

This class will try to understand the Divide and Conquer Algorithm Design Technique.

We have discussed the concepts of Selection, Bubble, and Insertion Sort in our previous classes.

Divide and Conquer Algorithm Design Technique

The algorithms that we have seen so far are iterative.

To write an algorithm, we have a design technique called divide and conquer.

The divide and conquer design technique aims to divide the problem into sub-problems, conquer those sub-problems, and combine those sub-problems to get the final solution.

The following steps are involved in the divide and conquer design technique.

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 to the whole problem.

Following are some algorithms designed based on the Divide and Conquer technique. 

1. Merge Sort
2. Quick Sort
3. Binary Search
4. Maximum and Minimum problem