Open In App
Related Articles

Divide and Conquer

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

Divide and Conquer is a problem-solving strategy that involves breaking down a complex problem into smaller, more manageable parts, solving each part individually, and then combining the solutions to solve the original problem. It is a widely used algorithmic technique in computer science and mathematics.

Example: In the Merge Sort algorithm, the “Divide and Conquer” strategy is used to sort a list of elements. Below image illustrate the dividing and merging states to sort the array using Merge Sort.

Merge-Sort

Merge Sort

Introduction to Divide and Conquer:

Standard Algorithms on Divide and Conquer:

Binary Search based problems:

Practice problems on Divide and Conquer:

Quick Links :


Last Updated : 22 Feb, 2024
Like Article
Save Article
Share your thoughts in the comments
Similar Reads