Divide and Conquer Algorithm Last Updated : 23 Jul, 2025 Comments Improve Suggest changes 11 Likes Like Report Divide and Conquer algorithm is a problem-solving strategy that involves. Divide : Break the given problem into smaller non-overlapping problems.Conquer : Solve Smaller ProblemsCombine : 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.BasicsIntroduction Advanced Master Theorem Standard AlgorithmsBinary SearchMerge SortQuick SortCalculate pow(x, n)Karatsuba algorithm for fast multiplicationStrassen’s Matrix MultiplicationConvex Hull (Simple Divide and Conquer Algorithm)Quickhull Algorithm for Convex HullPractice problemsSquare root of an integerMax and min using minimum comparisons Frequency in a limited range arrayTiling ProblemCount InversionsThe Skyline ProblemSearch in a Row and Column-wise Sorted GridAllocate minimum number of pagesModular Exponentiation Practice Standard AlgorithmsBinary Search Based ProblemsMerge Sort Based ProblemsQuick Sort Based Problems Quick Links :Learn Data Structure and Algorithms | DSA Tutorial‘Practice Problems’ on Divide and Conquer‘Quizzes’ on Divide and Conquer Create Quiz Comment H harendrakumar123 Follow 11 Improve H harendrakumar123 Follow 11 Improve Article Tags : Divide and Conquer DSA Explore DSA FundamentalsLogic Building Problems 2 min read Analysis of Algorithms 1 min read Data StructuresArray Data Structure 3 min read String in Data Structure 2 min read Hashing in Data Structure 2 min read Linked List Data Structure 2 min read Stack Data Structure 2 min read Queue Data Structure 2 min read Tree Data Structure 2 min read Graph Data Structure 3 min read Trie Data Structure 15+ min read AlgorithmsSearching Algorithms 2 min read Sorting Algorithms 3 min read Introduction to Recursion 15 min read Greedy Algorithms 3 min read Graph Algorithms 3 min read Dynamic Programming or DP 3 min read Bitwise Algorithms 4 min read AdvancedSegment Tree 2 min read Binary Indexed Tree or Fenwick Tree 15 min read Square Root (Sqrt) Decomposition Algorithm 15+ min read Binary Lifting 15+ min read Geometry 2 min read Interview PreparationInterview Corner 3 min read GfG160 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding Platform 1 min read Problem of The Day - Develop the Habit of Coding 5 min read Like