Divide and conquer
Recursive algorithms that divide a problem into roughly equal subproblems and then solve each subproblem recursively are called divide-and-conquer algorithms.
Examples
[[Merge Sort]] [[Quick Sort]]
Recursive algorithms that divide a problem into roughly equal subproblems and then solve each subproblem recursively are called divide-and-conquer algorithms.
[[Merge Sort]] [[Quick Sort]]