Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- 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
Updated on: 30-Jul-2019
472 Views
Advertisements