Algorithm Design: Divide-and-Conquer Algorithms
Understand the divide-and-conquer algorithms using selection and merge sort examples.
We'll cover the following
Divide-and-conquer algorithms
One big problem might be hard to solve, but two half-sized problems might be significantly easier. In these cases, divide-and-conquer algorithms cope well by:
-
Splitting the problem into smaller subproblems.
-
Solving the subproblems independently.
-
Combining the solutions of subproblems into a solution of the original problem.
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.