The divide-and-conquer design paradigm involves breaking down a problem into multiple sub-problems (this is known as splitting). Then, each sub-problem is solved, and finally, they are merged back to the final solution. In most cases, the splitting is done multiple times until the sub-problem is very trivial to solve. Divide-and-conquer algorithms work very well when a problem can be split into many, non-related parts of equal size.
%%🖋 Edit in Excalidraw, and the dark exported image%%
- Binary Tree Traversal
- Closest Pair Problem
- External Merge Sort
- Matrix Multiplication (Computer Science)
- Merge Sort
- Quick Sort