Divide and Conquer

This is an algorithm where we solve a problem by splitting it into several subproblems, solve each subproblem individually, and then combine the results.

Some common problems solved using the divide and conquer approach include:

  • Binary Search

  • Quick Sort

  • Merge Sort

  • Strassen's Matrix Multiplication

  • Maximum Subarray Problem

PreviousHuffman CodingNextBinary Search

Last updated