# Describe the two main requirements of divide-and-conquer algorithms.

Describe the two main requirements of divide-and-conquer algorithms.
You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

tafzijdeq
Divide-and-conquer algorithms
A divide-and-conquer algorithm is a strategy for solving the large problems by dividing these problems into small or sub parts. Recursion is used to solve these problems. the divide and conquer algorithms divided into three following parts are following-
1. Divide- First the given problem divide into sub problems using recursion.
2. Conquer- solve the sub problem, if It is small then solve it directly.
3. Combine- combine the solutions of small or sub-problems then solve the actual problem.
Binary Search, Quick Sort, Merge Sort, Strassen’s Algorithm are some standard Divide and Conquer algorithm.
Requirements of Divide and conquer algorithm
(1). The basic scenario of dividing and conquering can be seen in everyday life. From people going to the market with an list of things to buy or get and then dividing that items list in certain items for each person to get, then putting them into the same cart. Now checking out, It is a very simple example of the concept of the paradigm.
(2) Another example most of us will run into is a list of Works. Well If you have a big list of works that are expanded all over town may seem like a difficult task, but if the person divide their work list by where each place is located, and then sort each location’s places that where to go first and then second and so on, then that person could conquer their work list without feeling overworked. In reality it really makes everything in life easy or simple, if you follow, Try and apply the methods of divide and conquer.
So in other words, It will be logical if you use the divide and conquer algorithm for to make all of the complex problems in mathematics that will simpler and easier to solve and also beneficial. Overall, the point is easy and simple. The divide and conquer algorithm design paradigm is a advantage to the world of mathematics and It is a very good concept to know about and understand.