Breaks down a main problem into multiple sub-problems. Then it makes use of all sub-problems to find the solution
- Binary Search (Technically, Binary search is a decrease-and-conquer algorithm, as it uses only one half while searching at every iteration. I put it here because I (think) VCAA classifies it as a divide and conquer*)
- Merge Sort
- Quick Sort