
- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup
- Algorithm
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- DSA - Greedy Algorithms
- DSA - Divide and Conquer
- DSA - Dynamic Programming
- Data Structures
- DSA - Data Structure Basics
- DSA - Array Data Structure
- Stack & Queue
- DSA - Stack
- DSA - Expression Parsing
- DSA - Queue
- Searching Techniques
- DSA - Linear Search
- DSA - Binary Search
- DSA - Interpolation Search
- DSA - Hash Table
- Sorting Techniques
- DSA - Sorting Algorithms
- DSA - Bubble Sort
- DSA - Insertion Sort
- DSA - Selection Sort
- DSA - Merge Sort
- DSA - Shell Sort
- DSA - Quick Sort
- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal
- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Spanning Tree
- DSA - Heap
- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion
Introduction to Divide & Conquer Algorithms
The Divide and Conquer is one of the different algorithm paradigm. It has mainly three different steps −
Divide − In this phase the problem is divided into some small sub-problems of same type.
Conquer − Solve the sub problems recursively.
Combine − Combine the answers of the sub-problems to get the final answer.
In this Section We are going to cover
- Related Articles
- Introduction to Backtracking Algorithms
- Introduction to Searching Algorithms
- Introduction to Greedy Algorithms
- Introduction to Graph Algorithms
- Introduction to Pattern Searching Algorithms
- Introduction to Analysis of Algorithms
- Introduction to Algorithms for Mathematical Problems
- Advanced master theorem for divide and conquer recurrences
- Maximum Sum SubArray using Divide and Conquer in C++
- Convex Hull using Divide and Conquer Algorithm in C++
- Python Program to solve Maximum Subarray Problem using Divide and Conquer
- Implement divide & conquer logic in JavaScript to implement QuickSort
- Maximum Subarray Sum using Divide and Conquer algorithm in C++
- C++ Program to Search Sorted Sequence Using Divide and Conquer with the Aid of Fibonacci Numbers
- Algorithms and Complexities

Advertisements