From 92f40fb788357fc38cdf7badae5099ebe730d37d Mon Sep 17 00:00:00 2001
From: Divyansh24051547 <24051547@kiit.ac.in>
Date: Mon, 8 Dec 2025 23:21:43 +0530
Subject: [PATCH 1/2] knapsack 0-1 file added

---
 knapsack_01.class | Bin 0 -> 850 bytes
 knapsack_01.java  |  35 +++++++++++++++++++++++++++++++++++
 2 files changed, 35 insertions(+)
 create mode 100644 knapsack_01.class
 create mode 100644 knapsack_01.java

diff --git a/knapsack_01.class b/knapsack_01.class
new file mode 100644
index 0000000000000000000000000000000000000000..d06ff59045085fa54031aab91855f669175df23d
GIT binary patch
literal 850
zcmZuvO-~b16g{u=@yakT!^Z%{7QxQ~rYI(ufMJ1&NfXL6sUc~qktv<vKszO6AR4!@
zapl6q=#~W=H@Z+_3_CaeBaK1Nltwf$GxOfP=bd}+xp&^T)6XXWmXI}&fFhxq(4Y(0
zo8F!`Q}@D+8MnIWuSWv<-5?C2MFAx{xhj#QQK{q&80eNTP4u8wp!Ynk;6+c!X?RZs
zv}`^<neT#)K8b!40~q|LM(Np3<TuD}?y{1z+|Cj-XNs*Lj7m|<_ZkZZhA=EKVj_i6
zf$pu)+urfkw;tcT#R5Cc`kpV4%vSQ1xR!x5G7@7ZE@E6@;6E7!<aV6D9tx=0{NyUP
zd(9fNSj$1^uk1Fee(Ql(trO`fMJ!eDwmZJs@B)SnWh-Y|+moWuAlz7p6B(uEZfo7Y
zAH>1-Us7|i5R9{z1P2c&{5Ww4Owh`37cnyR3F18sflFNDV=y2Yw@y2zey1n7zn(f-
z%&2Q=b?qx;VqR6|G)K!E;<+-XJ9_#Mbw_)Hq@%xul~NsT*3lLB2*oK!Q)@X#Kg8`0
zJl#fON3D@{MyTc1{vf$ybTQQF@Xv8~Ul&KeUhQjK4^nDoHl2Id795M8g~?T8r#dW3
z9-;6FbYYq|=MK-7cyn638T-Uv@cbnPahVb1ouXezNb!@m&FY@-`vHwFW3S+9XAB2W
z`2de>`Nb$Js#{hyx2)-IS(k2ECf#z<reo{2beGRKwn>uhkY)FfW?SUh12J*9O-#83
p+gkhpYx+j!7|usrIR6tvEDsD*z$gkBLy@gK<UbO)Mm&M*zX5UHmxllV

literal 0
HcmV?d00001

diff --git a/knapsack_01.java b/knapsack_01.java
new file mode 100644
index 0000000..092e59d
--- /dev/null
+++ b/knapsack_01.java
@@ -0,0 +1,35 @@
+import java.util.*;
+class knapsack_01{
+
+    static int solve(int[] wt,int[] val,int w){
+        int n=wt.length;
+	int[][] dp=new int[n+1][w+1];
+	for(int i=0;i<=n;i++){
+           for(int j=0;j<=w;j++){
+               if(i==0 || j==0){
+                  dp[i][j]=0;
+	       }
+	       else if(wt[i-1]<=j){
+                  dp[i][j]=Math.max(val[i-1]+dp[i-1][j-wt[i-1]],dp[i-1][j]);
+	       }
+	       else{
+                  dp[i][j]=dp[i-1][j];
+	       }
+	   }
+	}
+        return dp[n][w];
+    }
+    public static void main(String[] args){
+       int[] wt={1,2,3,4,5,6,7};
+       // given a weight array 
+
+       int[] val={12,21,13,15,19,23,25};
+       // given a value array,containing values of ith weight 
+       // of weight array
+
+       int w=15;
+       // given the capacity of knapsack
+
+       System.out.println(solve(wt,val,w));
+    }
+}

From 9e3d5ff31799f878868451cfc6ff015eee70fe0b Mon Sep 17 00:00:00 2001
From: Divyansh24051547 <24051547@kiit.ac.in>
Date: Mon, 8 Dec 2025 23:40:48 +0530
Subject: [PATCH 2/2] unbounded knapsack file added

---
 knapsackUnbounded.class | Bin 0 -> 860 bytes
 knapsackUnbounded.java  |  36 ++++++++++++++++++++++++++++++++++++
 2 files changed, 36 insertions(+)
 create mode 100644 knapsackUnbounded.class
 create mode 100644 knapsackUnbounded.java

diff --git a/knapsackUnbounded.class b/knapsackUnbounded.class
new file mode 100644
index 0000000000000000000000000000000000000000..c50c6d0e1673bc447e4bff574832fcc50c63e88c
GIT binary patch
literal 860
zcmZuvO-~b16g{u=@!DaaLt!dNE1;+aOo=Seh+%<=NfXMDR7sj@!jw*Mpq(~lN@Qy=
zx^kz9ZdtH#qYEX*uyf-dGBE}{Q<@N?nVI+Q$2sqwx$k~I{c-|e894(nC=#j(4Z47}
z?e4jAbvM|WbE@0kW+<TF^#ea#5>Rr}>k@Gql}f>Yfj$Y-L_Y=u2F`g!H+(`&!+k2C
z<qC!ALIM^BB~m7aF#K1I(*ADfHHdC@Sjk@Lp5iy>*4lm$mcq8@HWm$}aY16l#3(Kb
z4DJMOYuDY}c^FiiouKB`SZ23b-}40Gxk{lDRWy)6R^pP0aZCsd{pVZ(*@~*v0|7Nx
zm|o|0uUX?M$rV5FRy&QV*M8tu>x}f5LKZB#t)8zoT%WXbu5zZh+b_!XgRRBrAfwdm
zv^Tx`end|HBRC()!36&+#!CPce(XL3CTV54izqVl8R7#Cfy-Q@G)Ra?ZJ-@Nf6$ZM
zU(cK@Wz~(0y73J%c1KkfG+WCaVqaO%Z9Q{{ZCiVbxUIiKa#Xdod0SVUBdpHYnp(@-
z`XO%i!n55-&pAui@*9z_*2u~qBSE6w1Dwa516>^besiF4eKD$L=QH{DUAd9;d6--^
z{-=&41&>hnBodhA4BcXGnKRVlj67rfCG)Q^j4NaicZ!sdkm48TF4=c`@Fz6B<WAvg
zuL;kg@&O)O@~cr+RHv+JPFd5PvM!ynj63DHMaR-D>8zY#tUiLQ1W{H$VOEMb%Zh-s
t2uwRgE4B0y$=Ms(W7wZCc76|OmXD-OVGKo%*BWo<5#<V8V?2iIe*hGIoYVjS

literal 0
HcmV?d00001

diff --git a/knapsackUnbounded.java b/knapsackUnbounded.java
new file mode 100644
index 0000000..dff1e73
--- /dev/null
+++ b/knapsackUnbounded.java
@@ -0,0 +1,36 @@
+import java.util.*;
+class knapsackUnbounded{
+
+  static int solve(int[] wt,int[] val,int w){
+     int n=wt.length;
+     int[][] dp=new int[n+1][w+1];
+     for(int i=0;i<=n;i++){
+        for(int j=0;j<=w;j++){
+           if(i==0 || j==0){
+              dp[i][j]=0;
+	   }
+	   else if(wt[i-1]<=j){
+              dp[i][j]=Math.max(val[i-1]+dp[i][j-wt[i-1]],dp[i-1][j]);
+	   }
+	   else{
+              dp[i][j]=dp[i-1][j];
+	   }
+	}
+     }
+     return dp[n][w];
+  }
+
+  public static void main(String[] args){
+     int[] wt={1,2,3,4,5,6,7};
+     // given weight array to be filled in knapsack
+
+     int[] val={11,9,13,18,16,18,22};
+     // given a value array ,to the corresponding ith weight
+     // int weight array
+     
+     int w=18;
+     //weight capacity of knapsack
+
+     System.out.println(solve(wt,val,w));
+  }
+}