1. Quick Sort
2. Binary Search
3. Binary Tree Traversal
4. Warshall’s Algorithm
5. Dijkstra’s Algorithm
6. Prim’s Algorithm
7. Knapsack Problem – Dynamic Programming
8. Subset Sum Problem – Backtracking
9. Travelling salesperson problem – Branch and Bound
10. Strassen’s matrix multiplication |