Divide and Conquer
A common strategy used to solve problems which can be divided to similar smaller problems. These smaller problems can then be solved and their outputs aggregated to solve the main problem.
Some common applications of Divide and Conquer are below, they will have implementation as part of this repository.
- Binary Search
- Heap Sort
- Finding Maximum and Minimum
- Merge Sort
- Quick Sort
- Strassen's Matrix Multiplication