The basic idea of divide and conquer is actually a problem of size N decomposed into k smaller sub-problems, these sub-problems independent of each other and the same as the original problem. Solutions such subproblems recursively, and then the combined solutions of each sub-problem and to obtain a solution of the original problem. In general divide and conquer method and procedure is based on a recursive algorithm. Divide and conquer method can be divided into three steps: decomposition of the problem, solve sub-problems, solutions of the combined sub-problem.
Which divide and conquer in my opinion the more important examples are: binary search and quick search. We must not only learn but also to grasp this idea of this method can also be split in the future of learning a big problem into a small problem and then one by one to resolve.