Divide, Conquer and Combine paradigm
Table of Contents
The idea behind Divide and Conquer is to recursively divide the original problem into two almost equal halves, until the subproblems can be solved instantly, then combine the solutions of subproblems to obtain the solution for the original bigger problem.
Divide and Conquer splits its input at prespecified deterministic points. It always split a big problem into two almost equal halves. It works best when the subproblems are independent/non-overlapping of each other. Since each subproblem is a small-sized original problem, we usually implement the Divide and Conquer algorithm in the form of recursive function.