The divide and conquer is an algorithm technique that first of all divides the problem into two or more sub problems. These sub problems are then mostly solved using recursion approach (straightforward manner can be used too). At the end combine those solutions of the sub problems into the solution for the original problem.
Following are some real world problems that can be solved using divide and conquer algorithm:
1. Efficient sorting algorithms such as merge sort, quick sort
2. Syntactic analysis such as top-down parser
3. Computing the discrete Fourier transform
Following are some real world problems that can be solved using divide and conquer algorithm:
1. Efficient sorting algorithms such as merge sort, quick sort
2. Syntactic analysis such as top-down parser
3. Computing the discrete Fourier transform
Comments
Post a Comment