Python/knapsack
Christian Clauss c909da9b08
pre-commit: Upgrade psf/black for stable style 2023 (#8110)
* pre-commit: Upgrade psf/black for stable style 2023

Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`.
* https://github.com/psf/black/blob/main/CHANGES.md#2310

> This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style…

Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit.

I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
2023-02-01 18:44:54 +05:30
..
tests Cleaned up knapsack and images directory (#3972) 2020-11-27 10:57:12 +01:00
__init__.py Add a naive recursive implementation of 0-1 Knapsack Problem (#2743) 2020-10-19 09:07:18 +08:00
greedy_knapsack.py Cleaned up knapsack and images directory (#3972) 2020-11-27 10:57:12 +01:00
knapsack.py Pyupgrade to Python 3.9 (#4718) 2021-09-07 13:37:03 +02:00
README.md Rewrite parts of Vector and Matrix (#5362) 2021-10-27 11:48:43 +08:00
recursive_approach_knapsack.py pre-commit: Upgrade psf/black for stable style 2023 (#8110) 2023-02-01 18:44:54 +05:30

A naive recursive implementation of 0-1 Knapsack Problem

This overview is taken from:

https://en.wikipedia.org/wiki/Knapsack_problem

Overview

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where the decision makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively.

The knapsack problem has been studied for more than a century, with early works dating as far back as 1897 The name "knapsack problem" dates back to the early works of mathematician Tobias Dantzig (18841956), and refers to the commonplace problem of packing the most valuable or useful items without overloading the luggage.


Documentation

This module uses docstrings to enable the use of Python's in-built help(...) function. For instance, try help(Vector), help(unit_basis_vector), and help(CLASSNAME.METHODNAME).


Usage

Import the module knapsack.py from the . directory into your project.


Tests

. contains Python unit tests which can be run with python3 -m unittest -v.