You take a problem, and break it down into smaller sub problems which you then solve recursively and then you somehow combine the results of the smaller sub-problem to get a solution to the original problem that you actually care about.
Merge Sort is the most transparent application of the Divide-and-Conquer paradigm.