Divide and Conquer

Divide and Conquer is an algorithmic paradigm used in many problems and algorithms . Some of the most common algorithms use divide and conquer principle and are highly effective.
A Divide and Conquer algorithm solves a problem in 3 steps :

1. Divide: Break the given problem into subproblems of same type.
2. Conquer: Recursively solve these subproblems
3. Combine: Appropriately combine the answers

It starts of by breaking down a problem into multiple parts that are simple enough to be solved and then all these subparts are solved individually. For the last part , the algorithm combines all the solutions into one. Some common examples of Divide and Conquer in algorithms are -

• Binary Search
• Merge Sort
• Quick Sort

Divide and Conquer is the principle applied to recursion and thus it is a very important technique and is of immense use for programmers.
Resources -

• Wikipedia
• Technical details