Q. What is divide and conquer technique?
- A divide and conquer algorithm is a strategy of solving a large problem by
- breaking the problem into smaller sub-problems (divide)
- solving the sub-problems recursiverly and sometimes directly for simpler one (conquer)
- Combining the subproblems solution to get the desired output (combine)
- Binary Search
- Merge Sort
- Quick Sort
- Strassen's Matrix Multiplication
- Karatsuba Algorithm
- Median finding problem and general order statistics
No comments:
Post a Comment