Like Greedy and Dynamic Programming , Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three steps. 1. Divide: Break the given problem into subproblems of same type. 2. Conquer: Recursively solve these subproblems 3. Combine: Appropriately combine the answers Following are some standard algorithms that are Divide and Conquer algorithms. 1) Binary Search is a searching algorithm. In each step, the algorithm compares the input element x with the value of the middle element in array. If the values match,
Read full article from Divide and Conquer | Set 1 (Introduction) | GeeksforGeeks
