Algorithm Design Techniques

Algorithm Design Techniques

Below are the list of several popular design approaches:-

Divide and Conquer:- Divide and Conquer is an algorithmic paradigm, in which we divide the problem into small sub-problems and then each sub-problem is solved independently and finally we combine them to get final result. There are following standard divide and conquare algorithms-

• Binary Search.
• Quick Sort.
• Merge Sort.
• Strassen's Matrix Multiplication.
• Closest Pair of Points.

Greedy Method:-

• Kruskal’s Minimum Spanning Tree (MST).
• Prim's Minimal Spanning Tree.
• Dijkstra's Minimal Spanning Tree.
• Knapsack Problem.

Dynamic Programming:-

• Kruskal’s Minimum Spanning Tree (MST).
• Prim's Minimal Spanning Tree.
• Dijkstra's Minimal Spanning Tree.
• Knapsack Problem.

---