📌Highlights: Hi friends! In this post I am going to explain about Knapsack problem using Greedy approach. I am try to explain with the help of examples.
Knapsack Problem is an application of Greedy Strategy / Method. By Knapsack problem we will find maximum profit. There are so many solution to solve any problem but we will select those solution which generate maximum profit.
Let here we see what the knapsack problem says by the help of an example.
Suppose we have some objects and every object is associated to some profit(p) and weight (w).
