Minimal Cycle Basis calculation for Weighted Undirected Graphs (greedy approach)

Implementation of Knapsack Problem using Greedy Algorithm and Dynamic Programming

Problems for Data Structures and Algorithms coded in C++

Some of the Computational problems are solved with the well known Algorithmic design strategies.

Our project is based on creating an application that takes an amount as an input from the user and then uses the greedy technique to find out what is the most optimal number of denominations needed to get the entered amount.