Introduction to Divide & Conquer Algorithms

The Divide and Conquer is one of the different algorithm paradigm. It has mainly three different steps −

Divide − In this phase the problem is divided into some small sub-problems of same type.

Conquer − Solve the sub problems recursively.

Combine − Combine the answers of the sub-problems to get the final answer.

In this Section We are going to cover

• Closest Pair Point Problem
• Select Peak element from 2D Array
• Count inversions in an array
• Median of two Sorted Array