0-1 Knapsack Problem

[abhisheks008]

Related Issue #162

🔴 Issue Name : 0-1 Knapsack Problem

🔴 Directory: Knapsack

• Hacktoberfest2021 Participant
• Contributor

Closes: #162

Description :

Created a folder in the Knapsack directory as 0-1 Knapsack and added scripts of Python to solve the problem statement using Brute force method and Dynamic Method. After implementation I have done a comparison in between those to find out the better method as per the time complexity.

Type of change

What sort of change have you made:

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Code style update (formatting, local variables)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• This change requires a documentation update

How Has This Been Tested?

This script or code has been tested using various test cases and scenarios.

Checklist:

• My code follows the guidelines of this project.
• I have performed a self-review of my own code.
• I have commented my code, particularly whereever it was hard to understand.
• I have made corresponding changes to the documentation.
• My changes generate no new warnings.
• I have added test cases that prove my fix is effective or that my feature works.

[prathimacode-hub]

Picture perfect as usual. Great going. Looks like old abhishek is back. @abhisheks008

[abhisheks008]

Trying to add more value to this repository, so that others can be beneficial from this! 🚀

[prathimacode-hub]

Your contributions are always been selfless, motivating and inspiring for others. No doubt in it. 😎@abhisheks008