Divide-and-Conquer

   Many useful algorithms are recrusive in structure:to solve a given problem,they call themselves recursively one or more times to deal with closely related subproblems.These algorithms typically follow a divide-and-conquer approach: They break the problem into several subproblems that are similar to the original problem but smaller in size,solve the subproblems recursively,and then combine these solutions to create a solution to the original problem.