Added question

madihamallick · madihamallick · commit f56ecf13f8f6 · 2021-07-17T11:17:23.000+05:30
diff --git a/Dynamic Programming/Knapsack_greedyMethod.c b/Dynamic Programming/Knapsack_greedyMethod.c
@@ -1,3 +1,9 @@
+/*Write program to find the maximum  profit and the solution vector for Knapsack problem. 
+  Consider the following constraints for knapsack. N=3,  M=20
+  Profit : 25 24 15
+  Weight : 18 15 10
+*/
+
 #include<stdio.h>
 #include<conio.h>
 int main(){
