Design & Analysis of Algorithms using C++

This repository focuses on designing an algorithm, its implementation, and analysis using the C++ programming language.

Contains

• Graph Algorithms
  • Adjacency Matrix
  • Adjacency List
  • BFS
  • DFS
  • Topological Sort
• Greedy Algorithms
  • Prim's Algorithm
  • Kruskal's Algorithm
  • Dijkstra's Algorithm
  • Fractional Knapsack
  • Job Sequencing with deadline
• Divide and Conquer Algorithms
  • Binary Search
  • Ternary Search
  • Maximum Minimum
  • Merge Sort
  • Quick Sort (Hoare & Lomuto's Algorithms)
  • Randomized Quick Sort
• Dynamic Programming Problems
  • 0/1 Knapsack
  • Bellman Ford's Single Source Shortest Path Algorithm
  • Floyd Warshall's All Pair of Shortest Path Algorithm
  • Maximum number of scalar multiplications for Matrix Chain Multiplication
• Backtracking Problems
  • n Queen Problem
  • Graph Coloring Problem
  • Hamiltonian Problem

Authors

• @Ankit Paul

Feedback

If you have any feedback, please reach out to me at [email protected]