Hey There! Here are all my self made codes of Design and Analysis of Algorithms during my Third Year in MIT School of Engineering, MITADTU.
- Merge Sort using Divide and Conquer Technique
- Quick Sort using Divide and Conquer Technique
- Strassen's Matrix Multiplication
- Find Min Max using Recursion & Divide and Conquer
- Prims Algorithm using Greedy Approach
- Kruskal's Algorithm using Greedy Approach
- Floyd Warshall using Dynamic Programming
- Longest Common Subsequence using Dynamic Programming
- N-Queens using BackTracking
- Traveling Salesperson using Branch and Bound
- 0-1 Knapsack using Branch and Bound
C++ - A High Level General Purpose Programming Language