The document discusses the divide and conquer problem solving approach. It explains that divide and conquer involves dividing a problem into smaller subproblems, solving those subproblems recursively, and then combining the solutions to solve the original problem. Some examples of algorithms that use divide and conquer are merge sort, quick sort, binary search, and finding the maximum sub-array. The approach is useful for solving difficult problems and enables parallelism and efficient memory access.

1. DIVIDE AND CONQUER
APROACH TOWARDS
PROBLEM SOLUTION
RASHID ANSARI
170847980002
MTECH(ACDS)

2. Divide and Conquer
 Basic Idea……
If the problem is easy, solve it directly
If the problem cannot be solved as is, decompose it into smaller
parts,.Solve the smaller parts

3. Divide and Conquer
You should think of this algorithm as having three parts:
 Divide the problem into a number of subproblems that are
smaller instances of the same problem.
 Conquer the subproblems by solving them recursively.If they
are small enough, solve the subproblems as base cases.
 Combine the solutions to the subproblems into the solution
for the original problem.

4. Divide and conquer

5. Applications
 Merge Sort
 Quick Sort
 Binary Search
 Maximum sub-array problem

7. MERGE SORT

8. ADVANTAGES
Solving difficult problems
Parallelism
Memory Access

9. THANKYOU