Divide and conquer is a general strategy employed by many different algorithms. The basic steps for divide and conquer are:
- Split the input into several distinct subsets
- Recursively call the algorithm on each of the subset
- Merge the results of each recursive call to form the answer
Merge sort is a popular example of a divide and conquer algorithm.