Skip to content

Latest commit

 

History

History
16 lines (16 loc) · 808 Bytes

README.md

File metadata and controls

16 lines (16 loc) · 808 Bytes
Raw

Design_and_Analysis_of_Algorithms_Lab_Assignment_Codes

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.

Code Title

  1. Merge Sort using Divide and Conquer Technique
  2. Quick Sort using Divide and Conquer Technique
  3. Strassen's Matrix Multiplication
  4. Find Min Max using Recursion & Divide and Conquer
  5. Prims Algorithm using Greedy Approach
  6. Kruskal's Algorithm using Greedy Approach
  7. Floyd Warshall using Dynamic Programming
  8. Longest Common Subsequence using Dynamic Programming
  9. N-Queens using BackTracking
  10. Traveling Salesperson using Branch and Bound
  11. 0-1 Knapsack using Branch and Bound

Built with

C++ - A High Level General Purpose Programming Language