Divide and Conquer Improve Improve Like Article Like Save Share 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 Table of Content What is Divide and Conquer? Standard Algorithms that follow Divide and Conquer Algorithm Example of Divide and Conquer Algorithm Introduction to Divide and Conquer Standard Algorithms on Divide and Conquer Binary Search based problems Practice problems on Divide and Conquer Introduction to Divide and Conquer: Introduction to Divide and Conquer Dynamic Programming vs Divide-and-Conquer Decrease and Conquer Advanced master theorem for divide and conquer recurrences Standard Algorithms on Divide and Conquer: 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 Binary Search based problems: Find a peak element in a given array Check for Majority Element in a sorted array K-th Element of Two Sorted Arrays Find the number of zeroes Find the Rotation Count in Rotated Sorted array Find the point where a monotonically increasing function becomes positive first time Median of two sorted arrays Median of two sorted arrays of different sizes The painter’s partition problem using Binary Search Practice problems on Divide and Conquer: Square root of an integer Maximum and minimum of an array using minimum number of comparisons Find frequency of each element in a limited range array in less than O(n) time Tiling Problem Count Inversions The Skyline Problem Search in a Row-wise and Column-wise Sorted 2D Array Allocate minimum number of pages Modular Exponentiation (Power in Modular Arithmetic) Quick Links : Learn Data Structure and Algorithms | DSA Tutorial ‘Practice Problems’ on Divide and Conquer ‘Quizzes’ on Divide and Conquer Last Updated : 22 Feb, 2024 Like Article Save Article Next Introduction to Divide and Conquer Algorithm - Data Structure and Algorithm Tutorials Share your thoughts in the comments Add Your Comment Please Login to comment...