As we know it, the Divide and Conquer Algorithm is based on the divide – observe that the given problem can be decomposed into smaller similar subproblems, deal with each of these subproblems separately, and finally, merge back the results to obtain the solution of the original problem. An illustrative example would be Merge Sort where each individual element of an array is sorted and later re-arranged in a larger sorted array using two pointers for ease of sorting.