> For the complete documentation index, see [llms.txt](https://vikram-bajaj.gitbook.io/cs-gy-6033-i-design-and-analysis-of-algorithms-1/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://vikram-bajaj.gitbook.io/cs-gy-6033-i-design-and-analysis-of-algorithms-1/divide-and-conquer.md).

# 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