- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
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
- Closest Pair Point Problem
- Select Peak element from 2D Array
- Count inversions in an array
- Median of two Sorted Array
Published on 01-Oct-2018 06:52:44
- Related Questions & Answers
- Implement divide & conquer logic in JavaScript to implement QuickSort
- 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
- 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
- Introduction to Databases
Advertisements