Divide and Conquer Algorithm
Last Updated :
23 Jul, 2025
Improve
Divide and Conquer algorithm is a problem-solving strategy that involves.
- Divide : Break the given problem into smaller non-overlapping problems.
- Conquer : Solve Smaller Problems
- Combine : Use the Solutions of Smaller Problems to find the overall result.
Examples of Divide and Conquer are Merge Sort, Quick Sort, Binary Search and Closest Pair of Points.
Basics
Standard Algorithms
- Binary Search
- Merge Sort
- Quick Sort
- Calculate pow(x, n)
- Karatsuba algorithm for fast multiplication
- Strassen’s Matrix Multiplication
- Convex Hull (Simple Divide and Conquer Algorithm)
- Quickhull Algorithm for Convex Hull
Practice problems
- Square root of an integer
- Max and min using minimum comparisons
- Frequency in a limited range array
- Tiling Problem
- Count Inversions
- The Skyline Problem
- Search in a Row and Column-wise Sorted Grid
- Allocate minimum number of pages
- Modular Exponentiation
Practice Standard Algorithms
Quick Links :
- Learn Data Structure and Algorithms | DSA Tutorial
- ‘Practice Problems’ on Divide and Conquer
- ‘Quizzes’ on Divide and Conquer
