feat: Add 0/1 Knapsack Problem: Recursive and Tabulation (Bottom-Up DP) Implementations in Java along with their corresponding Tests

[o000SAI000o]

1.Recursive Solution
-Uses a top-down approach without memoization.
-Highlights the decision process for including or excluding each item.
2.Tabulation (Bottom-Up DP) Solution
-Efficient dynamic programming approach using a 2D table.
-Includes a utility function to print the DP table.
-Demonstrates space-time tradeoff compared to recursion.

Both implementations follow consistent formatting, inline documentation, and are aligned with the repository's existing code structure.

[o000SAI000o]

can u help me with the errors?

[alxkm]

@o000SAI000o thank you for your contribution to the repository.

It looks like there are already several existing implementations of the Knapsack problem in the repository, and your solution appears to be very similar to them:

https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/Knapsack.java
https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackTest.java

https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/dynamicprogramming/KnapsackMemoization.java
https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java

Additionally, other variations of the Knapsack algorithm already exist in the repository.

And the error appears because the filename does not match the public class name exactly, which is a strict rule in Java.
And to fix this the class should be renamed:
public class ZeroOneknapsackTabTest to public class ZeroOneKnapsackTest

[o000SAI000o]

thanks alot, i thought ZeroOneknapsack is a diffferent and popular version of it thts why i tried that, ans sorry for filename tht was by mistake

[o000SAI000o]

knapsack tabulation is not in repo which is very time effient with a O(N) time complexity , is it ok if i add tht code in repo, it will be efficient to alot of learners.

[alxkm]

What do you think about renaming all related classes to start with Knapsack?
This way, it will be easier to find and group all Knapsack implementations together in the project.

[alxkm]

Consider using the final keyword here and in the following lines where applicable - it helps improve code clarity and prevents unintended reassignment.

[alxkm]

This comment is redundant, as it merely restates what is already clear from the class structure.

[alxkm]

The same suggestions for improvement also apply to this class.

[alxkm]

Consider refactoring these test methods into a single parameterized test. Since all tests follow the same pattern calling compute with different inputs and asserting expected outputs - using JUnit’s parameterized tests would reduce code duplication and improve maintainability. It will also make adding new test cases easier and keep the test class cleaner.

There are already many examples of parameterized tests in the repository.

[alxkm]

It makes sense to add input validation here, such as checks for null or empty arrays. This helps prevent runtime errors and makes the code more robust and reliable. And tests for that.

[alxkm]

Making some parameters final is considered good practice.

It makes sense to add input validation here also.

[alxkm]

@o000SAI000o the build needs to be fixed.

[o000SAI000o]

sure ill fix the build