Divide and Conquer

 Intro Video

If a given problem is large then we can divide into sub problems and solve (merge) until it is solved. When dividing each problem must be same in order to apply this algorithm.

Below are few problems which can be solved using divide and conquer algorithm : 

1. Binary Search

2. Find maximum and minimum

3. Merge Sort

4. Quick Sort

5. Strassen’s Matrix Multiplication

When we analyse above algorithms, we get a recurrence relation for time complexity.

Some problems based on divide and conquer.

Comments

Popular posts from this blog

gsutil Vs Storage Transfer Service Vs Transfer Appliance

SQL basic interview question