Data Structure – Design and analysis of Divide and Conquer Algorithms

• A⁺
• A 
• A^-

DIVIDE AND CONQUER ALGORITHM

In this approach ,we solve a problem recursively by applying 3 steps

1. DIVIDE-break the problem into several sub problems of smaller size.
2. CONQUER-solve the problem recursively
3. COMBINE-combine these solutions to create a solution to the original problem.

 
You may be interested in:
Data Structures and Algorithms – MCQs.
Data Structures and Algorithms Online Tests