Divide And Conquer Approach

  Divide-and-conquer is a top-down technique for designing algorithms that consists of dividing the problem into smaller sub-problems, we achieve the desired result by keep dividing the original problem in to many sub problems and solve those small (sub-problems)
recursively as its easy to calculate some small problem then to complete big one and finally combine all those sub problems to get the result of main problem.

divide-and-conquer paradigm consists of following major phases:

• Breaking the problem into several sub-problems that are similar to the original problem but smaller in size,
• Solve the sub-problem recursively (successively and independently), and then
• Combine these solutions to sub-problems to create a solution to the original problem.
  
  
  
  
  Quick sort is the best example of the divide and conquer течникуе