Contains C codes for following:
- Merge Sort
- Heap Sort
- Quick Sort
- Binary Search
- Strassen's Multiplication Algorithm
- Maximum Minimum Search using "Divide and Conquer" technique.
- Chained Matrix Multiplication using Dynamic Programming.
Graph Algorithms:
- Minimum Spanning Tree: Prim's, Kruskal's
- Shortest Path: a. All Pair Shortest Path(APSP): Floyed-Warshall's b. Single Source Shortest Path(SSSP): Dijktra's, Bellman-Ford
- Traversal Algorithms: a.Breadth First Search b.Depth First Search
- Travelling Salesman Problem(Not optimized)