Divide and conquer algorithms
• String Reconstruction
• Longest Common Subsequence
• Edit Distance
• Subset Sum
Greedy Algorithm
- Binary Search
- Quick Sort
- Merge Sort
- Integer Multiplication
- Matrix Multiplication (Strassen's algorithm)
- Maximal Subsequence
• String Reconstruction
• Longest Common Subsequence
• Edit Distance
• Subset Sum
Greedy Algorithm
- Kruskal’s Minimum Spanning Tree (MST):
- Prim’s Minimum Spanning Tree
- Dijkstra’s Shortest Path
- Huffman Coding