Divide-and-Conquer

Breaks down a main problem into multiple subproblems. Then it makes use of all subproblems 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